./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:04:05,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:04:05,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:04:05,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:04:05,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:04:05,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:04:05,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:04:05,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:04:05,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:04:05,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:04:05,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:04:05,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:04:05,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:04:05,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:04:05,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:04:05,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:04:05,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:04:05,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:04:05,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:04:05,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:04:05,688 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:04:05,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:04:05,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:04:05,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:04:05,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:04:05,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:04:05,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:04:05,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:04:05,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:04:05,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:04:05,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:04:05,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:04:05,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:04:05,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:04:05,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:04:05,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:04:05,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:04:05,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:04:05,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:04:05,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:04:05,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:04:05,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:04:05,703 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:04:05,728 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:04:05,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:04:05,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:04:05,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:04:05,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:04:05,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:04:05,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:04:05,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:04:05,730 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:04:05,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:04:05,731 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:04:05,731 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:04:05,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:04:05,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:04:05,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:04:05,732 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:04:05,732 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:04:05,732 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:04:05,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:04:05,733 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:04:05,734 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:04:05,734 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:04:05,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:04:05,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:04:05,734 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:04:05,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:04:05,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:04:05,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:04:05,735 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:04:05,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:04:05,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 [2022-07-14 06:04:05,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:04:05,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:04:05,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:04:05,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:04:05,944 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:04:05,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-07-14 06:04:05,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd19259f7/5405c643a2be4100b7b6b66c7a070b54/FLAG4dc5d72da [2022-07-14 06:04:06,416 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:04:06,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-07-14 06:04:06,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd19259f7/5405c643a2be4100b7b6b66c7a070b54/FLAG4dc5d72da [2022-07-14 06:04:06,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd19259f7/5405c643a2be4100b7b6b66c7a070b54 [2022-07-14 06:04:06,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:04:06,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:04:06,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:04:06,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:04:06,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:04:06,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b453805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06, skipping insertion in model container [2022-07-14 06:04:06,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:04:06,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:04:06,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:04:06,728 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:04:06,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:04:06,783 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:04:06,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06 WrapperNode [2022-07-14 06:04:06,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:04:06,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:04:06,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:04:06,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:04:06,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,815 INFO L137 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-07-14 06:04:06,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:04:06,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:04:06,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:04:06,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:04:06,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:04:06,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:04:06,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:04:06,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:04:06,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (1/1) ... [2022-07-14 06:04:06,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:04:06,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:06,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:04:06,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:04:06,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:04:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:04:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:04:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:04:06,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:04:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:04:06,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:04:06,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:04:07,022 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:04:07,023 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:04:07,236 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:04:07,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:04:07,241 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 06:04:07,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:04:07 BoogieIcfgContainer [2022-07-14 06:04:07,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:04:07,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:04:07,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:04:07,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:04:07,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:04:06" (1/3) ... [2022-07-14 06:04:07,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157cfb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:04:07, skipping insertion in model container [2022-07-14 06:04:07,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:04:06" (2/3) ... [2022-07-14 06:04:07,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157cfb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:04:07, skipping insertion in model container [2022-07-14 06:04:07,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:04:07" (3/3) ... [2022-07-14 06:04:07,250 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-1.i [2022-07-14 06:04:07,263 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:04:07,263 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-14 06:04:07,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:04:07,327 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@4356b0c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@bcf1230 [2022-07-14 06:04:07,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-14 06:04:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:04:07,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:07,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:07,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:07,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-14 06:04:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:07,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714691807] [2022-07-14 06:04:07,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:07,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714691807] [2022-07-14 06:04:07,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714691807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:07,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:07,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:04:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999087242] [2022-07-14 06:04:07,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:07,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:04:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:07,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:04:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:04:07,563 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:07,698 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-07-14 06:04:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:04:07,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:04:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:07,706 INFO L225 Difference]: With dead ends: 111 [2022-07-14 06:04:07,706 INFO L226 Difference]: Without dead ends: 107 [2022-07-14 06:04:07,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:04:07,711 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 106 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:07,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 103 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:04:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-14 06:04:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 55. [2022-07-14 06:04:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-14 06:04:07,749 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 7 [2022-07-14 06:04:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:07,750 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-14 06:04:07,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-14 06:04:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:04:07,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:07,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:07,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:04:07,751 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-14 06:04:07,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:07,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762745860] [2022-07-14 06:04:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:07,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:07,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762745860] [2022-07-14 06:04:07,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762745860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:07,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:07,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:04:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181293887] [2022-07-14 06:04:07,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:07,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:04:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:07,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:04:07,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:04:07,806 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:07,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:07,852 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-07-14 06:04:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:04:07,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:04:07,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:07,855 INFO L225 Difference]: With dead ends: 54 [2022-07-14 06:04:07,855 INFO L226 Difference]: Without dead ends: 54 [2022-07-14 06:04:07,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:04:07,857 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:07,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 83 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-14 06:04:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-14 06:04:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-07-14 06:04:07,860 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2022-07-14 06:04:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:07,861 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-07-14 06:04:07,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-07-14 06:04:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:04:07,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:07,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:07,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:04:07,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-14 06:04:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:07,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825986637] [2022-07-14 06:04:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:07,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:07,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825986637] [2022-07-14 06:04:07,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825986637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:07,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:07,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:04:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373676394] [2022-07-14 06:04:07,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:07,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:04:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:07,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:04:07,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:04:07,893 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:07,904 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-07-14 06:04:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:04:07,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:04:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:07,906 INFO L225 Difference]: With dead ends: 101 [2022-07-14 06:04:07,906 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 06:04:07,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:04:07,907 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 98 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:07,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 06:04:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 57. [2022-07-14 06:04:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-07-14 06:04:07,912 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 7 [2022-07-14 06:04:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:07,912 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-07-14 06:04:07,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-07-14 06:04:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:04:07,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:07,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:07,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:04:07,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:07,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:07,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-14 06:04:07,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:07,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056528980] [2022-07-14 06:04:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:07,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:07,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:07,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056528980] [2022-07-14 06:04:07,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056528980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:07,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:07,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:04:07,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799933748] [2022-07-14 06:04:07,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:07,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:04:07,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:07,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:04:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:04:07,954 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:08,026 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-07-14 06:04:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:04:08,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:04:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:08,028 INFO L225 Difference]: With dead ends: 105 [2022-07-14 06:04:08,028 INFO L226 Difference]: Without dead ends: 105 [2022-07-14 06:04:08,028 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-14 06:04:08,029 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:08,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 69 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-14 06:04:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 59. [2022-07-14 06:04:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-07-14 06:04:08,033 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 7 [2022-07-14 06:04:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:08,033 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-07-14 06:04:08,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-07-14 06:04:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:04:08,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:08,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:08,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:04:08,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash -533877068, now seen corresponding path program 1 times [2022-07-14 06:04:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:08,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302228812] [2022-07-14 06:04:08,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:08,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:08,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302228812] [2022-07-14 06:04:08,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302228812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:08,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:08,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:04:08,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413964149] [2022-07-14 06:04:08,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:08,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:04:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:08,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:04:08,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:04:08,060 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:08,085 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-14 06:04:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:04:08,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 06:04:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:08,086 INFO L225 Difference]: With dead ends: 53 [2022-07-14 06:04:08,086 INFO L226 Difference]: Without dead ends: 53 [2022-07-14 06:04:08,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:04:08,087 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:08,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-14 06:04:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-14 06:04:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-07-14 06:04:08,090 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 9 [2022-07-14 06:04:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:08,091 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-07-14 06:04:08,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-07-14 06:04:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:04:08,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:08,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:08,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:04:08,092 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:08,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash -533877067, now seen corresponding path program 1 times [2022-07-14 06:04:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:08,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604541779] [2022-07-14 06:04:08,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:08,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:08,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:08,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604541779] [2022-07-14 06:04:08,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604541779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:08,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:08,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:04:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216395571] [2022-07-14 06:04:08,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:08,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:04:08,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:08,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:04:08,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:04:08,121 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:08,142 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-14 06:04:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:04:08,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 06:04:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:08,143 INFO L225 Difference]: With dead ends: 47 [2022-07-14 06:04:08,143 INFO L226 Difference]: Without dead ends: 47 [2022-07-14 06:04:08,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:04:08,144 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:08,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-14 06:04:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-14 06:04:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-14 06:04:08,147 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 9 [2022-07-14 06:04:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:08,147 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-14 06:04:08,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-14 06:04:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:04:08,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:08,148 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:08,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:04:08,148 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-14 06:04:08,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:08,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052722492] [2022-07-14 06:04:08,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:08,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:08,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:08,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052722492] [2022-07-14 06:04:08,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052722492] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:08,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929978362] [2022-07-14 06:04:08,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:08,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:08,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:08,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:08,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 06:04:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:08,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:04:08,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:08,311 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:04:08,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:04:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:08,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:08,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929978362] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:08,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:08,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-14 06:04:08,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598515613] [2022-07-14 06:04:08,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:08,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:04:08,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:08,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:04:08,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:04:08,462 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:08,578 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-07-14 06:04:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:04:08,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 06:04:08,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:08,579 INFO L225 Difference]: With dead ends: 83 [2022-07-14 06:04:08,580 INFO L226 Difference]: Without dead ends: 83 [2022-07-14 06:04:08,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:04:08,580 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:08,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 128 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:04:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-14 06:04:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 44. [2022-07-14 06:04:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-07-14 06:04:08,583 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 11 [2022-07-14 06:04:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:08,583 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-07-14 06:04:08,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-07-14 06:04:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:04:08,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:08,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:08,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:08,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:08,801 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:08,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:08,802 INFO L85 PathProgramCache]: Analyzing trace with hash 229648597, now seen corresponding path program 1 times [2022-07-14 06:04:08,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:08,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236090931] [2022-07-14 06:04:08,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:08,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:08,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:08,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236090931] [2022-07-14 06:04:08,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236090931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:08,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:08,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:04:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196227221] [2022-07-14 06:04:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:08,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:04:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:08,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:04:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:04:08,852 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:08,882 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2022-07-14 06:04:08,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:04:08,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:04:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:08,883 INFO L225 Difference]: With dead ends: 94 [2022-07-14 06:04:08,883 INFO L226 Difference]: Without dead ends: 94 [2022-07-14 06:04:08,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:04:08,884 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:08,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 183 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:08,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-14 06:04:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2022-07-14 06:04:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-07-14 06:04:08,887 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 15 [2022-07-14 06:04:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:08,887 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-07-14 06:04:08,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-07-14 06:04:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:04:08,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:08,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:08,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:04:08,888 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash 487814035, now seen corresponding path program 1 times [2022-07-14 06:04:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:08,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296760362] [2022-07-14 06:04:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296760362] [2022-07-14 06:04:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296760362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:08,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:08,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:04:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072383369] [2022-07-14 06:04:08,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:08,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:04:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:08,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:04:08,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:04:08,936 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:08,964 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-07-14 06:04:08,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:04:08,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 06:04:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:08,965 INFO L225 Difference]: With dead ends: 67 [2022-07-14 06:04:08,965 INFO L226 Difference]: Without dead ends: 67 [2022-07-14 06:04:08,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:04:08,966 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 156 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:08,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 83 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-14 06:04:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2022-07-14 06:04:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-07-14 06:04:08,968 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 15 [2022-07-14 06:04:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:08,968 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-07-14 06:04:08,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-07-14 06:04:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:04:08,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:08,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:08,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:04:08,969 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:08,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:08,970 INFO L85 PathProgramCache]: Analyzing trace with hash -994678340, now seen corresponding path program 1 times [2022-07-14 06:04:08,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:08,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84948002] [2022-07-14 06:04:08,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:08,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:09,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:09,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84948002] [2022-07-14 06:04:09,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84948002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:09,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:09,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:04:09,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444320986] [2022-07-14 06:04:09,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:09,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:04:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:04:09,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:04:09,053 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:09,120 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-07-14 06:04:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:04:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:04:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:09,121 INFO L225 Difference]: With dead ends: 43 [2022-07-14 06:04:09,121 INFO L226 Difference]: Without dead ends: 43 [2022-07-14 06:04:09,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:04:09,124 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 131 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:09,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 73 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-14 06:04:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-14 06:04:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-07-14 06:04:09,141 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 18 [2022-07-14 06:04:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:09,141 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-07-14 06:04:09,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-07-14 06:04:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:04:09,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:09,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:09,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:04:09,143 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:09,143 INFO L85 PathProgramCache]: Analyzing trace with hash -994678339, now seen corresponding path program 1 times [2022-07-14 06:04:09,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:09,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314781936] [2022-07-14 06:04:09,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:09,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:09,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314781936] [2022-07-14 06:04:09,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314781936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:09,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:09,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:04:09,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737801776] [2022-07-14 06:04:09,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:09,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:04:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:04:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:04:09,225 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:09,360 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-14 06:04:09,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:04:09,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:04:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:09,361 INFO L225 Difference]: With dead ends: 49 [2022-07-14 06:04:09,361 INFO L226 Difference]: Without dead ends: 49 [2022-07-14 06:04:09,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:04:09,362 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 157 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:09,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 86 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:04:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-14 06:04:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-07-14 06:04:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-14 06:04:09,364 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2022-07-14 06:04:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:09,365 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-14 06:04:09,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-14 06:04:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:04:09,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:09,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:09,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:04:09,366 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash -770257435, now seen corresponding path program 1 times [2022-07-14 06:04:09,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:09,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192449042] [2022-07-14 06:04:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:09,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:09,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192449042] [2022-07-14 06:04:09,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192449042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:09,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:09,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:04:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710869412] [2022-07-14 06:04:09,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:09,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:04:09,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:09,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:04:09,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:04:09,510 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:09,633 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-14 06:04:09,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:04:09,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 06:04:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:09,633 INFO L225 Difference]: With dead ends: 48 [2022-07-14 06:04:09,633 INFO L226 Difference]: Without dead ends: 48 [2022-07-14 06:04:09,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:04:09,634 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 79 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:09,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 155 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:04:09,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-14 06:04:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-07-14 06:04:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-07-14 06:04:09,636 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 19 [2022-07-14 06:04:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:09,637 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-07-14 06:04:09,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-07-14 06:04:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:04:09,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:09,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:09,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:04:09,638 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash -770257436, now seen corresponding path program 1 times [2022-07-14 06:04:09,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:09,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999054903] [2022-07-14 06:04:09,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:09,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:09,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999054903] [2022-07-14 06:04:09,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999054903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:09,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:09,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:04:09,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163959437] [2022-07-14 06:04:09,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:09,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:04:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:04:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:04:09,782 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:10,252 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-07-14 06:04:10,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:04:10,252 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 06:04:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:10,253 INFO L225 Difference]: With dead ends: 85 [2022-07-14 06:04:10,253 INFO L226 Difference]: Without dead ends: 85 [2022-07-14 06:04:10,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2022-07-14 06:04:10,254 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 244 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:10,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 157 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:04:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-14 06:04:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2022-07-14 06:04:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-14 06:04:10,256 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 19 [2022-07-14 06:04:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:10,256 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-14 06:04:10,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-14 06:04:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:04:10,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:10,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:10,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:04:10,258 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:10,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:10,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807689, now seen corresponding path program 1 times [2022-07-14 06:04:10,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:10,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513655806] [2022-07-14 06:04:10,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:10,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:10,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:10,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513655806] [2022-07-14 06:04:10,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513655806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:10,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:10,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:04:10,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62717156] [2022-07-14 06:04:10,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:10,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:04:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:10,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:04:10,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:04:10,291 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:10,328 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-07-14 06:04:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:04:10,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:04:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:10,328 INFO L225 Difference]: With dead ends: 44 [2022-07-14 06:04:10,328 INFO L226 Difference]: Without dead ends: 44 [2022-07-14 06:04:10,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:04:10,329 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:10,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 95 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-14 06:04:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-14 06:04:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-07-14 06:04:10,331 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2022-07-14 06:04:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:10,331 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-07-14 06:04:10,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-07-14 06:04:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:04:10,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:10,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:10,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:04:10,332 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807690, now seen corresponding path program 1 times [2022-07-14 06:04:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:10,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942525377] [2022-07-14 06:04:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:10,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:10,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942525377] [2022-07-14 06:04:10,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942525377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:10,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:10,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:04:10,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618225226] [2022-07-14 06:04:10,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:10,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:04:10,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:10,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:04:10,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:04:10,391 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:10,430 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-07-14 06:04:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:04:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:04:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:10,431 INFO L225 Difference]: With dead ends: 88 [2022-07-14 06:04:10,431 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 06:04:10,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:04:10,432 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:10,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 199 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 06:04:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2022-07-14 06:04:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-14 06:04:10,435 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2022-07-14 06:04:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:10,435 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-14 06:04:10,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-14 06:04:10,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:04:10,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:10,436 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:10,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:04:10,436 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:10,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1703829822, now seen corresponding path program 1 times [2022-07-14 06:04:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:10,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548881089] [2022-07-14 06:04:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:10,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:10,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548881089] [2022-07-14 06:04:10,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548881089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:10,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:10,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:04:10,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108477615] [2022-07-14 06:04:10,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:10,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:04:10,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:10,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:04:10,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:04:10,508 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:10,558 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-07-14 06:04:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:04:10,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:04:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:10,559 INFO L225 Difference]: With dead ends: 75 [2022-07-14 06:04:10,559 INFO L226 Difference]: Without dead ends: 75 [2022-07-14 06:04:10,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:04:10,559 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:10,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 182 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-14 06:04:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-07-14 06:04:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-07-14 06:04:10,562 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 24 [2022-07-14 06:04:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:10,562 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-07-14 06:04:10,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-07-14 06:04:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:04:10,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:10,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:10,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:04:10,563 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:10,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:10,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2105509516, now seen corresponding path program 1 times [2022-07-14 06:04:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:10,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028731159] [2022-07-14 06:04:10,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:10,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:10,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:10,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028731159] [2022-07-14 06:04:10,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028731159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:10,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:10,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:04:10,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364828850] [2022-07-14 06:04:10,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:10,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:04:10,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:10,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:04:10,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:04:10,848 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:11,347 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-07-14 06:04:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:04:11,348 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:04:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:11,349 INFO L225 Difference]: With dead ends: 77 [2022-07-14 06:04:11,349 INFO L226 Difference]: Without dead ends: 77 [2022-07-14 06:04:11,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:04:11,350 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:11,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 165 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:04:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-14 06:04:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-07-14 06:04:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-14 06:04:11,352 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 24 [2022-07-14 06:04:11,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:11,352 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-14 06:04:11,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-14 06:04:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:04:11,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:11,353 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:11,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 06:04:11,354 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2126531648, now seen corresponding path program 1 times [2022-07-14 06:04:11,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:11,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155172358] [2022-07-14 06:04:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:11,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:11,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155172358] [2022-07-14 06:04:11,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155172358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:11,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:11,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:04:11,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657325405] [2022-07-14 06:04:11,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:11,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:04:11,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:11,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:04:11,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:04:11,475 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:11,675 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-07-14 06:04:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:04:11,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:04:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:11,676 INFO L225 Difference]: With dead ends: 120 [2022-07-14 06:04:11,676 INFO L226 Difference]: Without dead ends: 120 [2022-07-14 06:04:11,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:04:11,677 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:11,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 253 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:04:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-14 06:04:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2022-07-14 06:04:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-07-14 06:04:11,679 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 24 [2022-07-14 06:04:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:11,679 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-07-14 06:04:11,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-07-14 06:04:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:04:11,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:11,680 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:11,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:04:11,680 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1949580930, now seen corresponding path program 1 times [2022-07-14 06:04:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:11,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626180583] [2022-07-14 06:04:11,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:11,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:11,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626180583] [2022-07-14 06:04:11,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626180583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:11,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:11,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 06:04:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833664031] [2022-07-14 06:04:11,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:11,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:04:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:04:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:04:11,797 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:12,005 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2022-07-14 06:04:12,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:04:12,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:04:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:12,006 INFO L225 Difference]: With dead ends: 156 [2022-07-14 06:04:12,006 INFO L226 Difference]: Without dead ends: 156 [2022-07-14 06:04:12,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:04:12,007 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 100 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:12,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 188 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:04:12,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-14 06:04:12,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2022-07-14 06:04:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-07-14 06:04:12,009 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2022-07-14 06:04:12,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:12,009 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-07-14 06:04:12,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-07-14 06:04:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:04:12,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:12,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:12,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 06:04:12,010 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:12,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1664467980, now seen corresponding path program 1 times [2022-07-14 06:04:12,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:12,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854074323] [2022-07-14 06:04:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:12,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:12,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854074323] [2022-07-14 06:04:12,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854074323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:04:12,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:04:12,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:04:12,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395844569] [2022-07-14 06:04:12,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:04:12,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:04:12,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:12,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:04:12,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:04:12,154 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:12,184 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-07-14 06:04:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:04:12,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:04:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:12,184 INFO L225 Difference]: With dead ends: 104 [2022-07-14 06:04:12,185 INFO L226 Difference]: Without dead ends: 59 [2022-07-14 06:04:12,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:04:12,185 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:12,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 77 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:04:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-14 06:04:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-14 06:04:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-07-14 06:04:12,187 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 27 [2022-07-14 06:04:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:12,187 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-07-14 06:04:12,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-07-14 06:04:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:04:12,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:12,188 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:12,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 06:04:12,188 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash 235701316, now seen corresponding path program 1 times [2022-07-14 06:04:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:12,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972423899] [2022-07-14 06:04:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:12,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:12,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972423899] [2022-07-14 06:04:12,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972423899] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:12,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038382217] [2022-07-14 06:04:12,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:12,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:12,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:12,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:12,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:04:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:12,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-14 06:04:12,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:12,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:04:12,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-14 06:04:12,665 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:04:12,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:04:12,704 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:04:12,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:04:12,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:04:12,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:12,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:12,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:04:12,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:04:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:13,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:14,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038382217] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:14,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:14,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2022-07-14 06:04:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614535451] [2022-07-14 06:04:14,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:14,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-14 06:04:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:14,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-14 06:04:14,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2022-07-14 06:04:14,038 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:14,477 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-07-14 06:04:14,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:04:14,477 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-14 06:04:14,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:14,478 INFO L225 Difference]: With dead ends: 68 [2022-07-14 06:04:14,478 INFO L226 Difference]: Without dead ends: 68 [2022-07-14 06:04:14,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=237, Invalid=2213, Unknown=0, NotChecked=0, Total=2450 [2022-07-14 06:04:14,479 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:14,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 230 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 171 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-07-14 06:04:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-14 06:04:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-07-14 06:04:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.125) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-07-14 06:04:14,481 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 28 [2022-07-14 06:04:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:14,481 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-07-14 06:04:14,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-07-14 06:04:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:04:14,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:14,482 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:14,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:14,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-14 06:04:14,690 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1959516773, now seen corresponding path program 1 times [2022-07-14 06:04:14,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:14,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143278471] [2022-07-14 06:04:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:14,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:14,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-14 06:04:14,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:14,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143278471] [2022-07-14 06:04:14,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143278471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:14,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99644634] [2022-07-14 06:04:14,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:14,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:14,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:14,917 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:14,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:04:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:15,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 06:04:15,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:15,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:04:15,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:04:15,097 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:04:15,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:04:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:15,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:15,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 27 treesize of output 23 [2022-07-14 06:04:15,436 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:04:15,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:04:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:15,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99644634] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:15,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:15,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-14 06:04:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255245698] [2022-07-14 06:04:15,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:15,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 06:04:15,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:15,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 06:04:15,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-07-14 06:04:15,449 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:15,908 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-07-14 06:04:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:04:15,909 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-14 06:04:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:15,910 INFO L225 Difference]: With dead ends: 99 [2022-07-14 06:04:15,910 INFO L226 Difference]: Without dead ends: 99 [2022-07-14 06:04:15,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2022-07-14 06:04:15,911 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 470 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:15,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 305 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 418 Invalid, 0 Unknown, 36 Unchecked, 0.2s Time] [2022-07-14 06:04:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-14 06:04:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 71. [2022-07-14 06:04:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-07-14 06:04:15,916 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2022-07-14 06:04:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:15,916 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-07-14 06:04:15,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-07-14 06:04:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:04:15,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:15,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:15,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:16,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:16,136 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash -615477817, now seen corresponding path program 1 times [2022-07-14 06:04:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:16,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82161072] [2022-07-14 06:04:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:16,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:04:16,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:16,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82161072] [2022-07-14 06:04:16,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82161072] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:16,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341747957] [2022-07-14 06:04:16,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:16,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:16,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:16,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:16,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:04:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:16,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-14 06:04:16,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:16,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:04:16,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-14 06:04:16,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:04:16,764 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:04:16,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:04:16,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:16,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:16,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:04:16,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:04:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:04:17,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:17,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:04:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:04:17,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341747957] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:17,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:17,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2022-07-14 06:04:17,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414606801] [2022-07-14 06:04:17,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:17,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-14 06:04:17,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:17,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-14 06:04:17,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2022-07-14 06:04:17,899 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:18,623 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-07-14 06:04:18,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:04:18,623 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-14 06:04:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:18,624 INFO L225 Difference]: With dead ends: 72 [2022-07-14 06:04:18,624 INFO L226 Difference]: Without dead ends: 72 [2022-07-14 06:04:18,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2022-07-14 06:04:18,625 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:18,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 334 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 202 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2022-07-14 06:04:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-14 06:04:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-14 06:04:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-07-14 06:04:18,626 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 29 [2022-07-14 06:04:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:18,627 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-07-14 06:04:18,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-07-14 06:04:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 06:04:18,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:18,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:18,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-14 06:04:18,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:18,838 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1510311704, now seen corresponding path program 1 times [2022-07-14 06:04:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:18,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127233943] [2022-07-14 06:04:18,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:18,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:04:19,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:19,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127233943] [2022-07-14 06:04:19,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127233943] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:19,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221526530] [2022-07-14 06:04:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:19,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:19,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:19,240 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:19,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:04:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:19,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-14 06:04:19,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:19,378 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:04:19,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:04:19,393 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:04:19,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:04:19,508 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:04:19,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:04:19,526 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:04:19,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:04:19,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:19,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:19,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:04:19,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:04:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:19,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:20,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:04:20,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:04:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:20,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221526530] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:20,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:20,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2022-07-14 06:04:20,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411561669] [2022-07-14 06:04:20,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:20,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-14 06:04:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:20,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-14 06:04:20,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2026, Unknown=0, NotChecked=0, Total=2162 [2022-07-14 06:04:20,882 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:24,343 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-07-14 06:04:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-14 06:04:24,343 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-14 06:04:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:24,344 INFO L225 Difference]: With dead ends: 92 [2022-07-14 06:04:24,344 INFO L226 Difference]: Without dead ends: 92 [2022-07-14 06:04:24,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=652, Invalid=5668, Unknown=0, NotChecked=0, Total=6320 [2022-07-14 06:04:24,345 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 259 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:24,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 541 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 844 Invalid, 0 Unknown, 206 Unchecked, 0.5s Time] [2022-07-14 06:04:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-14 06:04:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-07-14 06:04:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.155844155844156) internal successors, (89), 79 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-07-14 06:04:24,350 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 34 [2022-07-14 06:04:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:24,350 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-07-14 06:04:24,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-07-14 06:04:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 06:04:24,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:24,351 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:24,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-14 06:04:24,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-14 06:04:24,560 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1489289572, now seen corresponding path program 2 times [2022-07-14 06:04:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:24,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372678795] [2022-07-14 06:04:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:24,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:24,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372678795] [2022-07-14 06:04:24,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372678795] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:24,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696300071] [2022-07-14 06:04:24,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:04:24,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:24,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:24,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:24,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:04:24,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:04:24,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:04:24,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 06:04:24,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:24,976 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:04:24,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:04:25,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:04:25,113 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:04:25,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:04:25,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:04:25,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:25,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:04:25,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:04:25,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:04:25,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:04:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:25,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:25,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:04:25,376 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:25,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:25,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 1)))) is different from false [2022-07-14 06:04:25,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:25,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:25,398 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:25,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_27| Int) (v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_27| v_ArrVal_915) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_27|) 0)))) is different from false [2022-07-14 06:04:25,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:04:25,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:04:25,413 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:04:25,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 135 [2022-07-14 06:04:25,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-14 06:04:25,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2022-07-14 06:04:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-14 06:04:25,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696300071] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:25,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:25,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 42 [2022-07-14 06:04:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720406376] [2022-07-14 06:04:25,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:25,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-14 06:04:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-14 06:04:25,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1024, Unknown=8, NotChecked=568, Total=1722 [2022-07-14 06:04:25,676 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:26,718 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-14 06:04:26,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:04:26,719 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-14 06:04:26,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:26,719 INFO L225 Difference]: With dead ends: 126 [2022-07-14 06:04:26,719 INFO L226 Difference]: Without dead ends: 126 [2022-07-14 06:04:26,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=246, Invalid=2129, Unknown=9, NotChecked=808, Total=3192 [2022-07-14 06:04:26,720 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:26,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 626 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 341 Invalid, 0 Unknown, 710 Unchecked, 0.2s Time] [2022-07-14 06:04:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-14 06:04:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2022-07-14 06:04:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 103 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2022-07-14 06:04:26,723 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 34 [2022-07-14 06:04:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:26,723 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2022-07-14 06:04:26,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-07-14 06:04:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:04:26,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:26,724 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:26,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:26,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:26,935 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash -412898380, now seen corresponding path program 2 times [2022-07-14 06:04:26,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:26,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106495224] [2022-07-14 06:04:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:26,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106495224] [2022-07-14 06:04:27,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106495224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410723819] [2022-07-14 06:04:27,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:04:27,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:27,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:27,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:27,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:04:27,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:04:27,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:04:27,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-14 06:04:27,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:27,491 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:04:27,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:04:27,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-14 06:04:27,561 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:04:27,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:04:27,574 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:04:27,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:04:27,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:27,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:27,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:04:27,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:04:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:28,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:28,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410723819] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:28,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:28,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 54 [2022-07-14 06:04:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983090897] [2022-07-14 06:04:28,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:28,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-14 06:04:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:28,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-14 06:04:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2722, Unknown=0, NotChecked=0, Total=2970 [2022-07-14 06:04:28,867 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:30,885 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-14 06:04:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-14 06:04:30,886 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:04:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:30,886 INFO L225 Difference]: With dead ends: 129 [2022-07-14 06:04:30,886 INFO L226 Difference]: Without dead ends: 58 [2022-07-14 06:04:30,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=837, Invalid=7719, Unknown=0, NotChecked=0, Total=8556 [2022-07-14 06:04:30,889 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 257 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:30,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 605 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1120 Invalid, 0 Unknown, 56 Unchecked, 0.6s Time] [2022-07-14 06:04:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-14 06:04:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-07-14 06:04:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-07-14 06:04:30,890 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 36 [2022-07-14 06:04:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:30,890 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-07-14 06:04:30,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-07-14 06:04:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:04:30,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:30,890 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:30,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:31,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:31,100 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1201741191, now seen corresponding path program 3 times [2022-07-14 06:04:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:31,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530588925] [2022-07-14 06:04:31,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:31,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530588925] [2022-07-14 06:04:31,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530588925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629904816] [2022-07-14 06:04:31,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:04:31,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:31,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:31,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:31,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:04:31,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-14 06:04:31,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:04:31,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 06:04:31,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:31,438 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:04:31,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:04:31,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:04:31,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:04:31,519 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:04:31,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:04:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:31,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:31,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-07-14 06:04:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:32,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629904816] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:32,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:32,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-14 06:04:32,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644337810] [2022-07-14 06:04:32,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:32,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:04:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:04:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:04:32,011 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:32,414 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-14 06:04:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:04:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-14 06:04:32,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:32,415 INFO L225 Difference]: With dead ends: 54 [2022-07-14 06:04:32,415 INFO L226 Difference]: Without dead ends: 54 [2022-07-14 06:04:32,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2022-07-14 06:04:32,416 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 280 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:32,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 226 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 325 Invalid, 0 Unknown, 82 Unchecked, 0.1s Time] [2022-07-14 06:04:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-14 06:04:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-07-14 06:04:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.1) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-07-14 06:04:32,418 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 38 [2022-07-14 06:04:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:32,418 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-07-14 06:04:32,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-07-14 06:04:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:04:32,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:32,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:32,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-14 06:04:32,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-14 06:04:32,626 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:32,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:32,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1400728745, now seen corresponding path program 2 times [2022-07-14 06:04:32,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:32,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692865] [2022-07-14 06:04:32,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:32,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:04:33,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692865] [2022-07-14 06:04:33,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257619116] [2022-07-14 06:04:33,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:04:33,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:33,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:33,072 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:33,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 06:04:33,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:04:33,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:04:33,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-14 06:04:33,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:33,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:04:33,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-14 06:04:33,255 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:04:33,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:04:33,327 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:04:33,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:04:33,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:04:33,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:33,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:33,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:04:33,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:04:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:04:33,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:04:34,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257619116] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:34,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:34,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 46 [2022-07-14 06:04:34,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270583768] [2022-07-14 06:04:34,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:34,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-14 06:04:34,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:34,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-14 06:04:34,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2022-07-14 06:04:34,769 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:35,508 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-07-14 06:04:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:04:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-14 06:04:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:35,509 INFO L225 Difference]: With dead ends: 59 [2022-07-14 06:04:35,509 INFO L226 Difference]: Without dead ends: 59 [2022-07-14 06:04:35,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=337, Invalid=3445, Unknown=0, NotChecked=0, Total=3782 [2022-07-14 06:04:35,510 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:35,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 266 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 264 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2022-07-14 06:04:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-14 06:04:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-07-14 06:04:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-07-14 06:04:35,512 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 39 [2022-07-14 06:04:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:35,512 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-07-14 06:04:35,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-07-14 06:04:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:04:35,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:35,512 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:35,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:35,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-14 06:04:35,719 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:35,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:35,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1072669446, now seen corresponding path program 4 times [2022-07-14 06:04:35,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:35,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133665025] [2022-07-14 06:04:35,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:35,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:36,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133665025] [2022-07-14 06:04:36,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133665025] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:36,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593482698] [2022-07-14 06:04:36,299 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:04:36,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:36,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:36,300 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:36,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 06:04:36,583 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:04:36,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:04:36,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-14 06:04:36,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:36,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:04:36,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:04:36,818 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:04:36,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:04:36,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:04:36,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:36,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:04:37,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:04:37,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:04:37,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:04:37,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:04:37,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:04:37,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-14 06:04:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:37,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:37,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:04:37,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:37,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1364) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:37,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:04:37,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:04:37,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:04:37,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 135 [2022-07-14 06:04:37,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2022-07-14 06:04:37,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-07-14 06:04:38,178 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:04:38,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:04:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-14 06:04:38,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593482698] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:38,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:38,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 62 [2022-07-14 06:04:38,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710161421] [2022-07-14 06:04:38,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:38,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-14 06:04:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:38,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-14 06:04:38,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3238, Unknown=4, NotChecked=348, Total=3782 [2022-07-14 06:04:38,222 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:38,528 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-07-14 06:04:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:04:38,528 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-14 06:04:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:38,529 INFO L225 Difference]: With dead ends: 91 [2022-07-14 06:04:38,529 INFO L226 Difference]: Without dead ends: 65 [2022-07-14 06:04:38,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=231, Invalid=3683, Unknown=4, NotChecked=372, Total=4290 [2022-07-14 06:04:38,535 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:38,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 791 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 278 Unchecked, 0.1s Time] [2022-07-14 06:04:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-14 06:04:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-07-14 06:04:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-07-14 06:04:38,537 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 44 [2022-07-14 06:04:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:38,539 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-07-14 06:04:38,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-07-14 06:04:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:04:38,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:38,540 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:38,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-14 06:04:38,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-14 06:04:38,742 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:38,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:38,743 INFO L85 PathProgramCache]: Analyzing trace with hash 682791063, now seen corresponding path program 5 times [2022-07-14 06:04:38,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:38,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516795145] [2022-07-14 06:04:38,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:38,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:38,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:38,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516795145] [2022-07-14 06:04:38,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516795145] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:38,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467757116] [2022-07-14 06:04:38,957 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:04:38,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:38,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:38,958 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:38,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 06:04:39,435 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-14 06:04:39,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:04:39,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 06:04:39,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:39,453 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:04:39,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:04:39,463 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:04:39,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:04:39,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:04:39,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:04:39,606 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:04:39,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:04:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:39,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:40,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467757116] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:40,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:40,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 34 [2022-07-14 06:04:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688754476] [2022-07-14 06:04:40,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:40,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 06:04:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 06:04:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 06:04:40,207 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:40,662 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-07-14 06:04:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:04:40,663 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-14 06:04:40,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:40,663 INFO L225 Difference]: With dead ends: 63 [2022-07-14 06:04:40,663 INFO L226 Difference]: Without dead ends: 63 [2022-07-14 06:04:40,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=410, Invalid=1752, Unknown=0, NotChecked=0, Total=2162 [2022-07-14 06:04:40,664 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 278 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:40,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 224 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 401 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-07-14 06:04:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-14 06:04:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-07-14 06:04:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-07-14 06:04:40,666 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 48 [2022-07-14 06:04:40,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:40,666 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-07-14 06:04:40,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-07-14 06:04:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:04:40,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:40,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:40,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:40,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:40,875 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 337884900, now seen corresponding path program 2 times [2022-07-14 06:04:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:40,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657228307] [2022-07-14 06:04:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 06:04:41,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:41,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657228307] [2022-07-14 06:04:41,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657228307] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:41,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492637291] [2022-07-14 06:04:41,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:04:41,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:41,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:41,420 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:41,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 06:04:41,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:04:41,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:04:41,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-14 06:04:41,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:41,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:04:41,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-14 06:04:41,655 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:04:41,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:04:41,792 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:04:41,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:04:41,807 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:04:41,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:04:41,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:41,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:41,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:04:41,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:04:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 06:04:42,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 06:04:43,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492637291] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:43,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:43,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 53 [2022-07-14 06:04:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825207186] [2022-07-14 06:04:43,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:43,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-14 06:04:43,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-14 06:04:43,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2657, Unknown=0, NotChecked=0, Total=2862 [2022-07-14 06:04:43,211 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:46,006 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2022-07-14 06:04:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-14 06:04:46,007 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-14 06:04:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:46,007 INFO L225 Difference]: With dead ends: 116 [2022-07-14 06:04:46,007 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 06:04:46,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2411 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1006, Invalid=9500, Unknown=0, NotChecked=0, Total=10506 [2022-07-14 06:04:46,008 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 210 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:46,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 404 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 664 Invalid, 0 Unknown, 44 Unchecked, 0.4s Time] [2022-07-14 06:04:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 06:04:46,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-07-14 06:04:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 86 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2022-07-14 06:04:46,010 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 54 [2022-07-14 06:04:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:46,010 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2022-07-14 06:04:46,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2022-07-14 06:04:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:04:46,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:46,011 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:46,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:46,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:46,219 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:46,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash 358907032, now seen corresponding path program 6 times [2022-07-14 06:04:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:46,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487754326] [2022-07-14 06:04:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:46,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:46,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487754326] [2022-07-14 06:04:46,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487754326] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:46,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978365723] [2022-07-14 06:04:46,693 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:04:46,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:46,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:46,694 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:46,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 06:04:46,994 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-14 06:04:46,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:04:46,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-14 06:04:46,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:47,007 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:04:47,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:04:47,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:04:47,252 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:04:47,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:04:47,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:04:47,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:47,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 06:04:47,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:04:47,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:04:47,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:04:47,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:04:47,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:04:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:47,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:47,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:04:47,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:47,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1793 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1793) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:47,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:04:47,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1792) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:04:47,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:04:47,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:04:47,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 3)) 0)) is different from false [2022-07-14 06:04:47,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 3)) 0)) is different from false [2022-07-14 06:04:47,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 3)) 0)) is different from false [2022-07-14 06:04:47,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 3)) 0)) is different from false [2022-07-14 06:04:47,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:04:47,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:04:47,779 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:04:47,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 135 [2022-07-14 06:04:47,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-07-14 06:04:47,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2022-07-14 06:04:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2022-07-14 06:04:48,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978365723] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:48,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:48,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 60 [2022-07-14 06:04:48,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809416994] [2022-07-14 06:04:48,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:48,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-14 06:04:48,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:48,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-14 06:04:48,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2223, Unknown=11, NotChecked=1144, Total=3540 [2022-07-14 06:04:48,326 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:49,161 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-07-14 06:04:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 06:04:49,161 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-14 06:04:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:49,162 INFO L225 Difference]: With dead ends: 126 [2022-07-14 06:04:49,162 INFO L226 Difference]: Without dead ends: 94 [2022-07-14 06:04:49,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=258, Invalid=3807, Unknown=11, NotChecked=1474, Total=5550 [2022-07-14 06:04:49,163 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 698 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:49,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 895 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 623 Invalid, 0 Unknown, 698 Unchecked, 0.2s Time] [2022-07-14 06:04:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-14 06:04:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-07-14 06:04:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 90 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-14 06:04:49,168 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 54 [2022-07-14 06:04:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:49,168 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-14 06:04:49,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-14 06:04:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 06:04:49,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:49,169 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:49,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:49,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-14 06:04:49,387 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:49,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2070188021, now seen corresponding path program 7 times [2022-07-14 06:04:49,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:49,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157821472] [2022-07-14 06:04:49,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:49,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:49,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:49,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157821472] [2022-07-14 06:04:49,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157821472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:49,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984119415] [2022-07-14 06:04:49,616 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:04:49,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:49,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:49,617 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:49,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 06:04:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:49,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 06:04:49,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:49,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:04:49,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:04:49,964 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:04:49,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:04:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:50,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:50,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-07-14 06:04:50,693 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:04:50,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:04:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:50,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984119415] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:50,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:50,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 44 [2022-07-14 06:04:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462371309] [2022-07-14 06:04:50,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:50,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-14 06:04:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-14 06:04:50,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1790, Unknown=0, NotChecked=0, Total=1980 [2022-07-14 06:04:50,697 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:51,311 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-07-14 06:04:51,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:04:51,312 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-14 06:04:51,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:51,312 INFO L225 Difference]: With dead ends: 92 [2022-07-14 06:04:51,312 INFO L226 Difference]: Without dead ends: 92 [2022-07-14 06:04:51,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=638, Invalid=2784, Unknown=0, NotChecked=0, Total=3422 [2022-07-14 06:04:51,313 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 497 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:51,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 370 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 631 Invalid, 0 Unknown, 57 Unchecked, 0.3s Time] [2022-07-14 06:04:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-14 06:04:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-07-14 06:04:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.125) internal successors, (99), 90 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-07-14 06:04:51,318 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 58 [2022-07-14 06:04:51,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:51,318 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-07-14 06:04:51,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:51,318 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-07-14 06:04:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:04:51,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:51,319 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:51,348 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-14 06:04:51,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:51,519 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:51,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:51,519 INFO L85 PathProgramCache]: Analyzing trace with hash -248680787, now seen corresponding path program 3 times [2022-07-14 06:04:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:51,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407844139] [2022-07-14 06:04:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:51,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-14 06:04:51,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:51,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407844139] [2022-07-14 06:04:51,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407844139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:51,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010878577] [2022-07-14 06:04:51,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:04:51,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:51,874 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:51,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 06:04:52,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-14 06:04:52,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:04:52,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-14 06:04:52,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:52,389 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:04:52,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:04:52,399 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:04:52,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:04:52,542 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:04:52,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:04:52,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:04:52,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:52,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:52,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-14 06:04:52,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:04:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-14 06:04:53,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-14 06:04:53,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010878577] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:53,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:53,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 56 [2022-07-14 06:04:53,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727555145] [2022-07-14 06:04:53,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:53,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-14 06:04:53,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:53,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-14 06:04:53,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2941, Unknown=0, NotChecked=0, Total=3192 [2022-07-14 06:04:53,874 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:55,731 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-07-14 06:04:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-14 06:04:55,733 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-14 06:04:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:55,733 INFO L225 Difference]: With dead ends: 90 [2022-07-14 06:04:55,733 INFO L226 Difference]: Without dead ends: 90 [2022-07-14 06:04:55,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=910, Invalid=6746, Unknown=0, NotChecked=0, Total=7656 [2022-07-14 06:04:55,734 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 168 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:55,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 337 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 905 Invalid, 0 Unknown, 3 Unchecked, 0.4s Time] [2022-07-14 06:04:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-14 06:04:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-14 06:04:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.0681818181818181) internal successors, (94), 89 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-07-14 06:04:55,736 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 59 [2022-07-14 06:04:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:55,737 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-07-14 06:04:55,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-07-14 06:04:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 06:04:55,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:55,737 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:55,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:55,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:55,956 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:55,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1595605642, now seen corresponding path program 8 times [2022-07-14 06:04:55,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:55,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675803800] [2022-07-14 06:04:55,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:55,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:56,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:56,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675803800] [2022-07-14 06:04:56,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675803800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:56,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840804739] [2022-07-14 06:04:56,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:04:56,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:56,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:56,575 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:56,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-14 06:04:56,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:04:56,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:04:56,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-14 06:04:56,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:04:56,799 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:04:56,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:04:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:04:57,099 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:04:57,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:04:57,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:04:57,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:04:57,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:04:57,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:04:57,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:04:57,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:04:57,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:04:57,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:04:57,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:04:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:57,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:04:57,567 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:04:57,571 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:57,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2267) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:04:57,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:04:57,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2266) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:04:57,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:04:57,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2265 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2265) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:04:57,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:04:57,609 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:04:57,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-14 06:04:57,617 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-14 06:04:57,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 4)) 0)) is different from false [2022-07-14 06:04:57,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 4)) 0)) is different from false [2022-07-14 06:04:57,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:04:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:04:57,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:04:57,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2022-07-14 06:04:57,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-14 06:04:57,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-07-14 06:04:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2022-07-14 06:04:58,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840804739] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:04:58,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:04:58,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 26] total 69 [2022-07-14 06:04:58,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136539269] [2022-07-14 06:04:58,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:04:58,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-14 06:04:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:04:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-14 06:04:58,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2919, Unknown=13, NotChecked=1560, Total=4692 [2022-07-14 06:04:58,265 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:04:58,915 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2022-07-14 06:04:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:04:58,915 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-07-14 06:04:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:04:58,916 INFO L225 Difference]: With dead ends: 135 [2022-07-14 06:04:58,916 INFO L226 Difference]: Without dead ends: 97 [2022-07-14 06:04:58,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=280, Invalid=4049, Unknown=13, NotChecked=1820, Total=6162 [2022-07-14 06:04:58,917 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1004 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:04:58,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 953 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 478 Invalid, 0 Unknown, 1004 Unchecked, 0.2s Time] [2022-07-14 06:04:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-14 06:04:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-07-14 06:04:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.065217391304348) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-14 06:04:58,923 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 64 [2022-07-14 06:04:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:04:58,923 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-14 06:04:58,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:04:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-14 06:04:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-14 06:04:58,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:04:58,924 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:04:58,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:04:59,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-14 06:04:59,132 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:04:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:04:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1757527917, now seen corresponding path program 9 times [2022-07-14 06:04:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:04:59,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28059514] [2022-07-14 06:04:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:04:59,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:04:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:04:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:04:59,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:04:59,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28059514] [2022-07-14 06:04:59,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28059514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:04:59,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367094384] [2022-07-14 06:04:59,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:04:59,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:04:59,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:04:59,432 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:04:59,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-14 06:05:00,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-14 06:05:00,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:05:00,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 06:05:00,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:05:00,131 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:05:00,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:05:00,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:05:00,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:05:00,295 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:05:00,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:05:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:00,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:05:00,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-07-14 06:05:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:01,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367094384] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:05:01,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:05:01,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2022-07-14 06:05:01,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387172512] [2022-07-14 06:05:01,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:05:01,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-14 06:05:01,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:05:01,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-14 06:05:01,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2664, Unknown=0, NotChecked=0, Total=2970 [2022-07-14 06:05:01,188 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:05:01,861 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-07-14 06:05:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:05:01,861 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-07-14 06:05:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:05:01,861 INFO L225 Difference]: With dead ends: 94 [2022-07-14 06:05:01,861 INFO L226 Difference]: Without dead ends: 94 [2022-07-14 06:05:01,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=686, Invalid=4284, Unknown=0, NotChecked=0, Total=4970 [2022-07-14 06:05:01,862 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 380 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:05:01,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 307 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 460 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-07-14 06:05:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-14 06:05:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-14 06:05:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 93 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-07-14 06:05:01,864 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 68 [2022-07-14 06:05:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:05:01,864 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-07-14 06:05:01,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-07-14 06:05:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-14 06:05:01,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:05:01,864 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:05:01,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-14 06:05:02,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:02,065 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:05:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:05:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1529659500, now seen corresponding path program 10 times [2022-07-14 06:05:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:05:02,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080894112] [2022-07-14 06:05:02,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:05:02,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:05:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:05:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:02,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:05:02,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080894112] [2022-07-14 06:05:02,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080894112] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:05:02,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501171900] [2022-07-14 06:05:02,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:05:02,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:02,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:05:02,824 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:05:02,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-14 06:05:03,583 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:05:03,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:05:03,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-14 06:05:03,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:05:03,599 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:05:03,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:05:03,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:05:03,999 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:05:03,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:04,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:05:04,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:05:04,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 06:05:04,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:05:04,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:05:04,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:04,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:04,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:04,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:05:04,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:05:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:04,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:05:04,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|))) is different from false [2022-07-14 06:05:04,632 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:05:04,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2636) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:05:04,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:05:04,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2635 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2635) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:05:04,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:05:04,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2634 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2634) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:05:04,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:05:04,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2633 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2633) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:05:04,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:05:04,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:05:04,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-14 06:05:04,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-14 06:05:04,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-14 06:05:04,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-14 06:05:04,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_~#dst#1.base_39| Int)) (or (= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_39| v_ArrVal_2632) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_39|) 0)))) is different from false [2022-07-14 06:05:04,730 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:05:04,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:05:04,735 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:05:04,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 135 [2022-07-14 06:05:04,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2022-07-14 06:05:04,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-07-14 06:05:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 79 not checked. [2022-07-14 06:05:05,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501171900] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:05:05,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:05:05,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 29, 29] total 78 [2022-07-14 06:05:05,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038931891] [2022-07-14 06:05:05,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:05:05,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-07-14 06:05:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:05:05,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-07-14 06:05:05,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3620, Unknown=16, NotChecked=2160, Total=6006 [2022-07-14 06:05:05,446 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:05:06,923 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2022-07-14 06:05:06,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-14 06:05:06,924 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-14 06:05:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:05:06,925 INFO L225 Difference]: With dead ends: 145 [2022-07-14 06:05:06,925 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 06:05:06,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 104 SyntacticMatches, 11 SemanticMatches, 95 ConstructedPredicates, 16 IntricatePredicates, 1 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=352, Invalid=6171, Unknown=21, NotChecked=2768, Total=9312 [2022-07-14 06:05:06,926 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1218 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:05:06,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1391 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 824 Invalid, 0 Unknown, 1218 Unchecked, 0.3s Time] [2022-07-14 06:05:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 06:05:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2022-07-14 06:05:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 97 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2022-07-14 06:05:06,927 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 74 [2022-07-14 06:05:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:05:06,927 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2022-07-14 06:05:06,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2022-07-14 06:05:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-14 06:05:06,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:05:06,928 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:05:06,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-14 06:05:07,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:07,136 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:05:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:05:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash -123927951, now seen corresponding path program 11 times [2022-07-14 06:05:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:05:07,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001919834] [2022-07-14 06:05:07,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:05:07,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:05:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:05:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:07,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:05:07,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001919834] [2022-07-14 06:05:07,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001919834] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:05:07,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256112626] [2022-07-14 06:05:07,450 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:05:07,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:07,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:05:07,452 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:05:07,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-14 06:05:15,455 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-14 06:05:15,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:05:15,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-14 06:05:15,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:05:15,482 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:05:15,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:05:15,490 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:05:15,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:05:15,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:05:15,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:05:15,750 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:05:15,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:05:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:15,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:05:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 66 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:16,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256112626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:05:16,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:05:16,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 52 [2022-07-14 06:05:16,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94805788] [2022-07-14 06:05:16,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:05:16,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-14 06:05:16,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:05:16,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-14 06:05:16,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2468, Unknown=0, NotChecked=0, Total=2756 [2022-07-14 06:05:16,963 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:05:17,726 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-07-14 06:05:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 06:05:17,727 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-14 06:05:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:05:17,727 INFO L225 Difference]: With dead ends: 98 [2022-07-14 06:05:17,727 INFO L226 Difference]: Without dead ends: 98 [2022-07-14 06:05:17,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=606, Invalid=5094, Unknown=0, NotChecked=0, Total=5700 [2022-07-14 06:05:17,728 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:05:17,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 529 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 852 Invalid, 0 Unknown, 51 Unchecked, 0.3s Time] [2022-07-14 06:05:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-14 06:05:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-14 06:05:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2022-07-14 06:05:17,730 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 78 [2022-07-14 06:05:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:05:17,730 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2022-07-14 06:05:17,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2022-07-14 06:05:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-14 06:05:17,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:05:17,730 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:05:17,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-14 06:05:17,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:17,931 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:05:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:05:17,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2047124210, now seen corresponding path program 12 times [2022-07-14 06:05:17,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:05:17,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091754295] [2022-07-14 06:05:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:05:17,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:05:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:05:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:18,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:05:18,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091754295] [2022-07-14 06:05:18,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091754295] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:05:18,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008733463] [2022-07-14 06:05:18,685 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:05:18,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:18,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:05:18,686 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:05:18,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-14 06:05:23,335 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-07-14 06:05:23,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:05:23,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 185 conjunts are in the unsatisfiable core [2022-07-14 06:05:23,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:05:23,357 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:05:23,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:05:23,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-14 06:05:23,713 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:05:23,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:05:23,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:05:23,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:05:23,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:05:23,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:05:23,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:05:24,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:05:24,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:24,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:24,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:24,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:24,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:24,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:24,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:05:24,924 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:05:24,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-14 06:05:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:24,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:05:24,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:05:24,937 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:05:24,942 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3058 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3058) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:05:24,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:05:24,951 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3057) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)))) is different from false [2022-07-14 06:05:24,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:05:24,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3056 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3056) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:05:24,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:05:24,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3055 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3055) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:05:25,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:05:25,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3054 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3054) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:05:25,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:05:25,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:05:25,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 6)))) is different from false [2022-07-14 06:05:25,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 6)) 0)) is different from false [2022-07-14 06:05:25,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 6)) 0)) is different from false [2022-07-14 06:05:25,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 6)) 0)) is different from false [2022-07-14 06:05:25,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:05:25,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:05:25,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:05:25,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2022-07-14 06:05:25,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-14 06:05:25,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-07-14 06:05:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 113 not checked. [2022-07-14 06:05:25,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008733463] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:05:25,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:05:25,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32, 32] total 95 [2022-07-14 06:05:25,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910848365] [2022-07-14 06:05:25,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:05:25,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-07-14 06:05:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:05:25,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-07-14 06:05:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5771, Unknown=17, NotChecked=2856, Total=8930 [2022-07-14 06:05:25,930 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:05:27,261 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2022-07-14 06:05:27,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-14 06:05:27,262 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-07-14 06:05:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:05:27,263 INFO L225 Difference]: With dead ends: 152 [2022-07-14 06:05:27,263 INFO L226 Difference]: Without dead ends: 102 [2022-07-14 06:05:27,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 17 IntricatePredicates, 9 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=430, Invalid=9127, Unknown=17, NotChecked=3536, Total=13110 [2022-07-14 06:05:27,263 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 32 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1635 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:05:27,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1558 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 732 Invalid, 0 Unknown, 1635 Unchecked, 0.3s Time] [2022-07-14 06:05:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-14 06:05:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-14 06:05:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.04) internal successors, (104), 101 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2022-07-14 06:05:27,266 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 84 [2022-07-14 06:05:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:05:27,266 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2022-07-14 06:05:27,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2022-07-14 06:05:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 06:05:27,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:05:27,267 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:05:27,300 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-14 06:05:27,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-14 06:05:27,468 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:05:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:05:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1064449423, now seen corresponding path program 13 times [2022-07-14 06:05:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:05:27,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452757912] [2022-07-14 06:05:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:05:27,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:05:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:05:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 45 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:05:27,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452757912] [2022-07-14 06:05:27,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452757912] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:05:27,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515774850] [2022-07-14 06:05:27,808 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:05:27,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:27,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:05:27,809 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:05:27,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-14 06:05:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:05:28,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-14 06:05:28,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:05:28,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:05:28,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:05:28,300 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:05:28,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:05:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 66 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:28,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:05:28,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-07-14 06:05:29,597 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:05:29,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:05:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 55 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:29,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515774850] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:05:29,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:05:29,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 58 [2022-07-14 06:05:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320478740] [2022-07-14 06:05:29,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:05:29,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-14 06:05:29,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:05:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-14 06:05:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3140, Unknown=0, NotChecked=0, Total=3422 [2022-07-14 06:05:29,602 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:05:30,525 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-07-14 06:05:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:05:30,525 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-07-14 06:05:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:05:30,526 INFO L225 Difference]: With dead ends: 102 [2022-07-14 06:05:30,526 INFO L226 Difference]: Without dead ends: 102 [2022-07-14 06:05:30,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1074, Invalid=6236, Unknown=0, NotChecked=0, Total=7310 [2022-07-14 06:05:30,527 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 749 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:05:30,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 720 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1013 Invalid, 0 Unknown, 99 Unchecked, 0.3s Time] [2022-07-14 06:05:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-14 06:05:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-14 06:05:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.03) internal successors, (103), 101 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2022-07-14 06:05:30,529 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 88 [2022-07-14 06:05:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:05:30,529 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2022-07-14 06:05:30,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2022-07-14 06:05:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-14 06:05:30,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:05:30,533 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:05:30,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:05:30,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-14 06:05:30,751 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:05:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:05:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1646098544, now seen corresponding path program 14 times [2022-07-14 06:05:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:05:30,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291444520] [2022-07-14 06:05:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:05:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:05:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:05:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:31,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:05:31,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291444520] [2022-07-14 06:05:31,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291444520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:05:31,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972915966] [2022-07-14 06:05:31,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:05:31,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:31,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:05:31,841 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:05:31,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-14 06:05:32,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:05:32,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:05:32,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-14 06:05:32,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:05:32,134 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:05:32,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:05:32,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:05:32,687 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:05:32,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:32,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:05:32,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:05:32,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 06:05:33,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:05:33,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:05:33,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:33,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 16 treesize of output 18 [2022-07-14 06:05:33,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:33,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:33,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:05:33,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:05:33,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:05:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:33,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:05:33,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:05:33,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:05:33,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3524 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3524) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:05:33,549 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:05:33,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3523 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3523) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:05:33,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:05:33,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3522) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:05:33,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:05:33,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3521) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:05:33,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)))) is different from false [2022-07-14 06:05:33,591 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3520 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3520) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:05:33,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:05:33,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3519 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3519) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:05:33,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-14 06:05:33,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-14 06:05:33,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)))) is different from false [2022-07-14 06:05:33,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-14 06:05:33,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-14 06:05:33,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-14 06:05:33,691 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:05:33,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:05:33,696 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:05:33,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2022-07-14 06:05:33,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-14 06:05:33,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2022-07-14 06:05:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 153 not checked. [2022-07-14 06:05:34,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972915966] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:05:34,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:05:34,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 35, 35] total 96 [2022-07-14 06:05:34,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292650991] [2022-07-14 06:05:34,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:05:34,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-14 06:05:34,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:05:34,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-14 06:05:34,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=5647, Unknown=19, NotChecked=3192, Total=9120 [2022-07-14 06:05:34,751 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:05:36,919 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2022-07-14 06:05:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-14 06:05:36,919 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-14 06:05:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:05:36,920 INFO L225 Difference]: With dead ends: 165 [2022-07-14 06:05:36,920 INFO L226 Difference]: Without dead ends: 109 [2022-07-14 06:05:36,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 135 SyntacticMatches, 15 SemanticMatches, 117 ConstructedPredicates, 19 IntricatePredicates, 1 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=413, Invalid=9544, Unknown=19, NotChecked=4066, Total=14042 [2022-07-14 06:05:36,921 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1877 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:05:36,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2091 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1509 Invalid, 0 Unknown, 1877 Unchecked, 0.5s Time] [2022-07-14 06:05:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-14 06:05:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-07-14 06:05:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 105 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-07-14 06:05:36,923 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 94 [2022-07-14 06:05:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:05:36,923 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-07-14 06:05:36,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-07-14 06:05:36,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-14 06:05:36,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:05:36,923 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:05:36,947 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-14 06:05:37,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:37,124 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:05:37,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:05:37,125 INFO L85 PathProgramCache]: Analyzing trace with hash -45925907, now seen corresponding path program 15 times [2022-07-14 06:05:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:05:37,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172891142] [2022-07-14 06:05:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:05:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:05:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:05:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 66 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:37,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:05:37,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172891142] [2022-07-14 06:05:37,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172891142] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:05:37,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408138033] [2022-07-14 06:05:37,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:05:37,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:37,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:05:37,736 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:05:37,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-14 06:05:45,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-14 06:05:45,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:05:45,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-14 06:05:45,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:05:45,442 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:05:45,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:05:45,450 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:05:45,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:05:45,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:05:45,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:05:45,857 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:05:45,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:05:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:46,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:05:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 120 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:05:47,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408138033] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:05:47,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:05:47,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 69 [2022-07-14 06:05:47,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57047573] [2022-07-14 06:05:47,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:05:47,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-14 06:05:47,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:05:47,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-14 06:05:47,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=4329, Unknown=0, NotChecked=0, Total=4830 [2022-07-14 06:05:47,472 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:05:49,267 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2022-07-14 06:05:49,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-14 06:05:49,268 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-14 06:05:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:05:49,268 INFO L225 Difference]: With dead ends: 112 [2022-07-14 06:05:49,268 INFO L226 Difference]: Without dead ends: 112 [2022-07-14 06:05:49,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1882, Invalid=8018, Unknown=0, NotChecked=0, Total=9900 [2022-07-14 06:05:49,269 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 731 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:05:49,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 519 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 782 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2022-07-14 06:05:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-14 06:05:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-07-14 06:05:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2022-07-14 06:05:49,271 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 98 [2022-07-14 06:05:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:05:49,271 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2022-07-14 06:05:49,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:05:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-07-14 06:05:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-14 06:05:49,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:05:49,272 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:05:49,288 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-14 06:05:49,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:49,472 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:05:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:05:49,473 INFO L85 PathProgramCache]: Analyzing trace with hash -14055494, now seen corresponding path program 3 times [2022-07-14 06:05:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:05:49,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434173535] [2022-07-14 06:05:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:05:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:05:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:05:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 103 proven. 97 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-14 06:05:50,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:05:50,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434173535] [2022-07-14 06:05:50,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434173535] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:05:50,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322726850] [2022-07-14 06:05:50,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:05:50,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:05:50,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:05:50,536 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:05:50,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-14 06:05:59,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-14 06:05:59,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:05:59,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 236 conjunts are in the unsatisfiable core [2022-07-14 06:05:59,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:05:59,172 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:05:59,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:05:59,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-14 06:05:59,959 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-14 06:05:59,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 33 [2022-07-14 06:05:59,982 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:05:59,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:06:00,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:06:00,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:06:00,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-14 06:06:00,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-14 06:06:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:03,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:06:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:11,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322726850] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:06:11,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:06:11,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 40, 40] total 110 [2022-07-14 06:06:11,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751857855] [2022-07-14 06:06:11,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:06:11,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-07-14 06:06:11,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:11,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-07-14 06:06:11,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1005, Invalid=11205, Unknown=0, NotChecked=0, Total=12210 [2022-07-14 06:06:11,666 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:26,445 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2022-07-14 06:06:26,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-07-14 06:06:26,445 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-07-14 06:06:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:26,446 INFO L225 Difference]: With dead ends: 183 [2022-07-14 06:06:26,446 INFO L226 Difference]: Without dead ends: 175 [2022-07-14 06:06:26,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10760 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=3115, Invalid=35497, Unknown=0, NotChecked=0, Total=38612 [2022-07-14 06:06:26,447 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 345 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 977 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:26,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1181 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1539 Invalid, 0 Unknown, 977 Unchecked, 1.8s Time] [2022-07-14 06:06:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-14 06:06:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2022-07-14 06:06:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2022-07-14 06:06:26,449 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 104 [2022-07-14 06:06:26,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:26,449 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2022-07-14 06:06:26,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-07-14 06:06:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-14 06:06:26,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:26,450 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:26,463 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-14 06:06:26,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:26,662 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:06:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash 6966638, now seen corresponding path program 16 times [2022-07-14 06:06:26,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:26,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334785421] [2022-07-14 06:06:26,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:27,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:27,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334785421] [2022-07-14 06:06:27,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334785421] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:27,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912045529] [2022-07-14 06:06:27,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:06:27,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:27,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:27,819 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:27,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-14 06:06:28,985 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:06:28,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:06:28,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 204 conjunts are in the unsatisfiable core [2022-07-14 06:06:28,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:06:29,006 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:06:29,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:06:29,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:06:29,726 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:06:29,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:06:29,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:06:29,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:29,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:06:29,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:06:29,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:06:30,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:30,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:30,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:30,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:30,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:31,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:31,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:31,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:31,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:31,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:06:31,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:06:31,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2022-07-14 06:06:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:31,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:06:31,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:06:31,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:06:31,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4321 (Array Int Int)) (v_ArrVal_4322 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4321) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:06:31,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:06:31,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4320 (Array Int Int)) (v_ArrVal_4322 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4320) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:06:31,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:06:31,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4319 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4319) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:06:31,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)))) is different from false [2022-07-14 06:06:31,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4318 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4318) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:06:31,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)))) is different from false [2022-07-14 06:06:31,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4317 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4317) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:06:31,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:06:31,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4316 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4316) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:06:31,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-14 06:06:31,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4315 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4315) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-14 06:06:31,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (not (<= |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-14 06:06:31,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (not (<= |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-14 06:06:31,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (< |c_ULTIMATE.start_cstpncpy_~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-14 06:06:31,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (< |c_ULTIMATE.start_cstpncpy_~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-14 06:06:31,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (< |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-14 06:06:32,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (< |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-14 06:06:32,097 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:06:32,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:06:32,103 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:06:32,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2022-07-14 06:06:32,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-07-14 06:06:32,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-14 06:06:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 198 not checked. [2022-07-14 06:06:33,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912045529] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:06:33,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:06:33,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 39, 39] total 117 [2022-07-14 06:06:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546874678] [2022-07-14 06:06:33,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:06:33,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-07-14 06:06:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-07-14 06:06:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=8851, Unknown=21, NotChecked=4368, Total=13572 [2022-07-14 06:06:33,736 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:36,220 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2022-07-14 06:06:36,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-14 06:06:36,221 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-07-14 06:06:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:36,221 INFO L225 Difference]: With dead ends: 174 [2022-07-14 06:06:36,221 INFO L226 Difference]: Without dead ends: 112 [2022-07-14 06:06:36,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 138 SyntacticMatches, 10 SemanticMatches, 146 ConstructedPredicates, 21 IntricatePredicates, 5 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=539, Invalid=15525, Unknown=22, NotChecked=5670, Total=21756 [2022-07-14 06:06:36,223 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1940 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:36,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2205 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 859 Invalid, 0 Unknown, 1940 Unchecked, 0.3s Time] [2022-07-14 06:06:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-14 06:06:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-07-14 06:06:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-07-14 06:06:36,225 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2022-07-14 06:06:36,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:36,225 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-07-14 06:06:36,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-07-14 06:06:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-14 06:06:36,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:36,226 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:36,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-14 06:06:36,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-07-14 06:06:36,447 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:06:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1020694645, now seen corresponding path program 17 times [2022-07-14 06:06:36,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:36,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396225890] [2022-07-14 06:06:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 91 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:36,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:36,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396225890] [2022-07-14 06:06:36,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396225890] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:36,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139662512] [2022-07-14 06:06:36,874 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:06:36,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:36,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:36,876 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:36,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-14 06:06:48,729 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-14 06:06:48,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:06:48,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-14 06:06:48,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:06:48,765 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:06:48,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:06:48,774 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:06:48,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:06:49,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:06:49,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:06:49,186 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:06:49,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:06:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 120 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:49,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:06:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 153 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:50,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139662512] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:06:50,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:06:50,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 24] total 69 [2022-07-14 06:06:50,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366154235] [2022-07-14 06:06:50,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:06:50,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-14 06:06:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:50,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-14 06:06:50,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=4312, Unknown=0, NotChecked=0, Total=4830 [2022-07-14 06:06:50,914 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 70 states, 69 states have (on average 4.3768115942028984) internal successors, (302), 70 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:51,749 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-07-14 06:06:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-14 06:06:51,749 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 4.3768115942028984) internal successors, (302), 70 states have internal predecessors, (302), 0 states have call successors, (0), 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 108 [2022-07-14 06:06:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:51,750 INFO L225 Difference]: With dead ends: 117 [2022-07-14 06:06:51,750 INFO L226 Difference]: Without dead ends: 117 [2022-07-14 06:06:51,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1496, Invalid=7246, Unknown=0, NotChecked=0, Total=8742 [2022-07-14 06:06:51,751 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 633 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:51,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 863 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1331 Invalid, 0 Unknown, 77 Unchecked, 0.4s Time] [2022-07-14 06:06:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-14 06:06:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2022-07-14 06:06:51,754 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-14 06:06:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-07-14 06:06:51,754 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 108 [2022-07-14 06:06:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:51,754 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-07-14 06:06:51,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 4.3768115942028984) internal successors, (302), 70 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-07-14 06:06:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 06:06:51,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:51,755 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:51,783 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-14 06:06:51,968 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,SelfDestructingSolverStorable44 [2022-07-14 06:06:51,968 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:06:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:51,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1842522996, now seen corresponding path program 18 times [2022-07-14 06:06:51,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:51,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826621980] [2022-07-14 06:06:51,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:51,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:52,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:52,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826621980] [2022-07-14 06:06:52,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826621980] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:52,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856690672] [2022-07-14 06:06:52,986 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:06:52,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:52,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:52,987 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:52,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-14 06:07:19,874 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-07-14 06:07:19,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:19,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-14 06:07:19,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:19,925 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:07:19,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:07:20,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:07:20,591 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:07:20,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:20,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:07:20,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:07:20,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 06:07:20,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:07:21,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:07:21,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:21,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:21,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:21,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-14 06:07:21,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 16 treesize of output 18 [2022-07-14 06:07:21,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:21,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:21,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 14 treesize of output 16 [2022-07-14 06:07:21,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:07:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:21,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:21,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:07:21,634 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:21,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4888) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:21,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:07:21,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4887) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:07:21,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:07:21,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4886 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4886) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:07:21,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:21,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4885 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4885) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:21,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:07:21,673 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4884 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4884) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:07:21,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:07:21,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4883 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4883) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:07:21,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)))) is different from false [2022-07-14 06:07:21,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4882 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4882) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-14 06:07:21,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)))) is different from false [2022-07-14 06:07:21,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4881 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4881) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)))) is different from false [2022-07-14 06:07:21,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-14 06:07:21,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-14 06:07:21,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-14 06:07:21,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-14 06:07:21,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 9)) 0)) is different from false [2022-07-14 06:07:21,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 9)) 0)) is different from false [2022-07-14 06:07:21,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:21,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:07:21,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:21,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 135 [2022-07-14 06:07:21,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2022-07-14 06:07:21,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-07-14 06:07:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 251 not checked. [2022-07-14 06:07:23,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856690672] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:23,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:23,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 41, 41] total 117 [2022-07-14 06:07:23,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544461838] [2022-07-14 06:07:23,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:23,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-07-14 06:07:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-07-14 06:07:23,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=8488, Unknown=23, NotChecked=4738, Total=13572 [2022-07-14 06:07:23,171 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 117 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:25,793 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2022-07-14 06:07:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-14 06:07:25,803 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 0 states have call successors, (0), 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-14 06:07:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:25,804 INFO L225 Difference]: With dead ends: 190 [2022-07-14 06:07:25,804 INFO L226 Difference]: Without dead ends: 122 [2022-07-14 06:07:25,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 162 SyntacticMatches, 16 SemanticMatches, 143 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 2865 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=496, Invalid=14335, Unknown=23, NotChecked=6026, Total=20880 [2022-07-14 06:07:25,805 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 45 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 6040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3754 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:25,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2554 Invalid, 6040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2251 Invalid, 0 Unknown, 3754 Unchecked, 0.7s Time] [2022-07-14 06:07:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-14 06:07:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2022-07-14 06:07:25,807 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-14 06:07:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-07-14 06:07:25,807 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-07-14 06:07:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:25,808 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-07-14 06:07:25,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-07-14 06:07:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-14 06:07:25,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:25,810 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:25,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-14 06:07:26,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-14 06:07:26,025 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:07:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:26,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1876047465, now seen corresponding path program 19 times [2022-07-14 06:07:26,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:26,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122226335] [2022-07-14 06:07:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 120 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:26,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:26,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122226335] [2022-07-14 06:07:26,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122226335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:26,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754410149] [2022-07-14 06:07:26,528 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:07:26,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:26,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:26,529 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:07:26,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-14 06:07:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:26,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-14 06:07:26,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:27,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:07:27,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:07:27,220 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:07:27,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:07:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:27,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:27,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-07-14 06:07:28,656 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:07:28,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:07:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 136 proven. 344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:28,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754410149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:28,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:28,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 73 [2022-07-14 06:07:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254707490] [2022-07-14 06:07:28,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:28,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-07-14 06:07:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:28,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-07-14 06:07:28,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=4955, Unknown=0, NotChecked=0, Total=5402 [2022-07-14 06:07:28,661 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 74 states, 73 states have (on average 3.9178082191780823) internal successors, (286), 74 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-14 06:07:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:30,044 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2022-07-14 06:07:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 06:07:30,045 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 3.9178082191780823) internal successors, (286), 74 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 118 [2022-07-14 06:07:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:30,046 INFO L225 Difference]: With dead ends: 127 [2022-07-14 06:07:30,046 INFO L226 Difference]: Without dead ends: 127 [2022-07-14 06:07:30,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1897 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2186, Invalid=9586, Unknown=0, NotChecked=0, Total=11772 [2022-07-14 06:07:30,047 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 562 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:30,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 958 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1594 Invalid, 0 Unknown, 141 Unchecked, 0.5s Time] [2022-07-14 06:07:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-14 06:07:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-07-14 06:07:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2022-07-14 06:07:30,050 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 118 [2022-07-14 06:07:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:30,050 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2022-07-14 06:07:30,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.9178082191780823) internal successors, (286), 74 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-14 06:07:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-07-14 06:07:30,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-14 06:07:30,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:30,051 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:30,086 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-14 06:07:30,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:30,288 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:07:30,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:30,288 INFO L85 PathProgramCache]: Analyzing trace with hash 307297514, now seen corresponding path program 20 times [2022-07-14 06:07:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:30,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629738357] [2022-07-14 06:07:30,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:30,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:31,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:31,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629738357] [2022-07-14 06:07:31,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629738357] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:31,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853950556] [2022-07-14 06:07:31,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:07:31,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:31,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:31,799 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:07:31,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-14 06:07:32,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:07:32,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:32,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 201 conjunts are in the unsatisfiable core [2022-07-14 06:07:32,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:32,197 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:07:32,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:07:32,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:07:32,972 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:07:32,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:33,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:07:33,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:07:33,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 06:07:33,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:07:33,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:07:33,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:33,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-14 06:07:33,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:33,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:33,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:33,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:33,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:33,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:33,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:07:33,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:07:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:33,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:33,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|))) is different from false [2022-07-14 06:07:33,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:33,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5500 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5500) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:33,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:07:33,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5499 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5499) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:07:33,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:07:33,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5498 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5498) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:07:33,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:33,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5497 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5497) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:33,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:07:33,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5496 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5496) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:07:33,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:07:33,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5495 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5495) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:07:33,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-14 06:07:33,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5494 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5494) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-14 06:07:33,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:07:33,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5493 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5493) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:07:33,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-14 06:07:33,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5492 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5492) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-14 06:07:33,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:07:33,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:07:33,951 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 10)) 0)) is different from false [2022-07-14 06:07:33,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 10)) 0)) is different from false [2022-07-14 06:07:33,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 10)) 0)) is different from false [2022-07-14 06:07:33,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 10)) 0)) is different from false [2022-07-14 06:07:34,020 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:34,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:07:34,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:34,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2022-07-14 06:07:34,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-07-14 06:07:34,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-14 06:07:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 309 not checked. [2022-07-14 06:07:35,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853950556] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:35,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:35,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 44, 44] total 123 [2022-07-14 06:07:35,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897714144] [2022-07-14 06:07:35,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:35,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2022-07-14 06:07:35,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:35,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2022-07-14 06:07:35,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=9244, Unknown=25, NotChecked=5400, Total=15006 [2022-07-14 06:07:35,151 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand has 123 states, 123 states have (on average 2.5528455284552845) internal successors, (314), 123 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:37,564 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2022-07-14 06:07:37,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-14 06:07:37,565 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 123 states have (on average 2.5528455284552845) internal successors, (314), 123 states have internal predecessors, (314), 0 states have call successors, (0), 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 124 [2022-07-14 06:07:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:37,571 INFO L225 Difference]: With dead ends: 206 [2022-07-14 06:07:37,571 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 06:07:37,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 179 SyntacticMatches, 22 SemanticMatches, 149 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 3181 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=509, Invalid=15316, Unknown=25, NotChecked=6800, Total=22650 [2022-07-14 06:07:37,573 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 2852 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 4965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2915 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:37,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2900 Invalid, 4965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2033 Invalid, 0 Unknown, 2915 Unchecked, 0.5s Time] [2022-07-14 06:07:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 06:07:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2022-07-14 06:07:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2022-07-14 06:07:37,577 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2022-07-14 06:07:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:37,577 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2022-07-14 06:07:37,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 2.5528455284552845) internal successors, (314), 123 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-07-14 06:07:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-14 06:07:37,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:37,578 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:37,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-14 06:07:37,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-14 06:07:37,791 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:07:37,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1115754873, now seen corresponding path program 21 times [2022-07-14 06:07:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:37,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132300954] [2022-07-14 06:07:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 153 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:38,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:38,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132300954] [2022-07-14 06:07:38,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132300954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:38,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042004337] [2022-07-14 06:07:38,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:07:38,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:38,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:38,357 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:07:38,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-14 06:08:14,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-14 06:08:14,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:08:14,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-14 06:08:14,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:08:14,930 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:08:14,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:08:15,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:08:15,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:08:15,336 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:08:15,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:08:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 190 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:15,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:08:16,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-07-14 06:08:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 190 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:17,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042004337] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:08:17,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:08:17,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 89 [2022-07-14 06:08:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273689733] [2022-07-14 06:08:17,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:08:17,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-07-14 06:08:17,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:08:17,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-07-14 06:08:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=873, Invalid=7137, Unknown=0, NotChecked=0, Total=8010 [2022-07-14 06:08:17,772 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 90 states, 89 states have (on average 4.224719101123595) internal successors, (376), 90 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:08:19,503 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2022-07-14 06:08:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-14 06:08:19,504 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 89 states have (on average 4.224719101123595) internal successors, (376), 90 states have internal predecessors, (376), 0 states have call successors, (0), 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 128 [2022-07-14 06:08:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:08:19,505 INFO L225 Difference]: With dead ends: 137 [2022-07-14 06:08:19,505 INFO L226 Difference]: Without dead ends: 137 [2022-07-14 06:08:19,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3061 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3159, Invalid=13353, Unknown=0, NotChecked=0, Total=16512 [2022-07-14 06:08:19,507 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 1123 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:08:19,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 854 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1436 Invalid, 0 Unknown, 102 Unchecked, 0.4s Time] [2022-07-14 06:08:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-14 06:08:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-07-14 06:08:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2022-07-14 06:08:19,513 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 128 [2022-07-14 06:08:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:08:19,514 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2022-07-14 06:08:19,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 89 states have (on average 4.224719101123595) internal successors, (376), 90 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2022-07-14 06:08:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-14 06:08:19,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:08:19,515 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:08:19,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-14 06:08:19,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-14 06:08:19,725 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:08:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:08:19,725 INFO L85 PathProgramCache]: Analyzing trace with hash 479110792, now seen corresponding path program 22 times [2022-07-14 06:08:19,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:08:19,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058289132] [2022-07-14 06:08:19,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:08:19,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:08:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:08:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:08:21,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058289132] [2022-07-14 06:08:21,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058289132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:08:21,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772804704] [2022-07-14 06:08:21,363 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:08:21,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:08:21,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:08:21,364 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:08:21,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-14 06:08:24,294 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:08:24,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:08:24,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 213 conjunts are in the unsatisfiable core [2022-07-14 06:08:24,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:08:24,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:08:24,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:08:25,059 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:08:25,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:08:25,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:08:25,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:08:25,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:08:25,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:08:25,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:08:25,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:25,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:25,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:25,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:25,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:26,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:26,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:26,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:26,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:26,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:08:26,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:08:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:26,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:08:26,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:08:26,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:08:26,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int)) (v_ArrVal_6161 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6161) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:08:26,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:08:26,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6160 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6160) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-14 06:08:26,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:08:26,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6159 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6159) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-14 06:08:26,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:08:26,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6158 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6158) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:08:26,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:08:26,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6157 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6157) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-14 06:08:26,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:08:26,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6156 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6156) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-14 06:08:26,359 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-14 06:08:26,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6155 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6155) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-14 06:08:26,370 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:08:26,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6154 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6154) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:08:26,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-14 06:08:26,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int)) (v_ArrVal_6153 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6153) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-14 06:08:26,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:08:26,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int)) (v_ArrVal_6152 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_6152) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:08:26,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6162 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:08:26,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6151 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_6151) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:08:26,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6151 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_6151) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 11)) 0)) is different from false [2022-07-14 06:08:26,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6151 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_6151) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 11)) 0)) is different from false [2022-07-14 06:08:26,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6151 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_6151) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 11)) 0)) is different from false [2022-07-14 06:08:26,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6151 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_6151) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_6162) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 11)) 0)) is different from false [2022-07-14 06:08:26,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_52| Int) (v_ArrVal_6151 (Array Int Int)) (v_ArrVal_6162 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_52| v_ArrVal_6151) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_6162) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 11)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_52|) 0)))) is different from false [2022-07-14 06:08:26,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:26,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-14 06:08:26,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:26,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 135 [2022-07-14 06:08:26,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-14 06:08:26,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 110 treesize of output 94 [2022-07-14 06:08:28,001 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:08:28,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-14 06:08:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 373 not checked. [2022-07-14 06:08:28,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772804704] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:08:28,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:08:28,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 48, 48] total 133 [2022-07-14 06:08:28,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407034425] [2022-07-14 06:08:28,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:08:28,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 133 states [2022-07-14 06:08:28,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:08:28,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2022-07-14 06:08:28,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10619, Unknown=28, NotChecked=6524, Total=17556 [2022-07-14 06:08:28,047 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand has 133 states, 133 states have (on average 2.5488721804511276) internal successors, (339), 133 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:08:30,347 INFO L93 Difference]: Finished difference Result 222 states and 223 transitions. [2022-07-14 06:08:30,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-07-14 06:08:30,347 INFO L78 Accepts]: Start accepts. Automaton has has 133 states, 133 states have (on average 2.5488721804511276) internal successors, (339), 133 states have internal predecessors, (339), 0 states have call successors, (0), 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 134 [2022-07-14 06:08:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:08:30,349 INFO L225 Difference]: With dead ends: 222 [2022-07-14 06:08:30,349 INFO L226 Difference]: Without dead ends: 142 [2022-07-14 06:08:30,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 193 SyntacticMatches, 28 SemanticMatches, 146 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 3641 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=489, Invalid=13864, Unknown=39, NotChecked=7364, Total=21756 [2022-07-14 06:08:30,356 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 39 mSDsluCounter, 3047 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 6175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3825 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:08:30,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3099 Invalid, 6175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2332 Invalid, 0 Unknown, 3825 Unchecked, 0.7s Time] [2022-07-14 06:08:30,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-14 06:08:30,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2022-07-14 06:08:30,367 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-14 06:08:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-07-14 06:08:30,375 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2022-07-14 06:08:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:08:30,375 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-07-14 06:08:30,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 133 states, 133 states have (on average 2.5488721804511276) internal successors, (339), 133 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-07-14 06:08:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-14 06:08:30,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:08:30,376 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:08:30,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-07-14 06:08:30,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-14 06:08:30,577 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-14 06:08:30,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:08:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash 268761061, now seen corresponding path program 23 times [2022-07-14 06:08:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:08:30,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757489594] [2022-07-14 06:08:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:08:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:08:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:08:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 190 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:08:31,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757489594] [2022-07-14 06:08:31,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757489594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:08:31,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193664917] [2022-07-14 06:08:31,208 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:08:31,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:08:31,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:08:31,209 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:08:31,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process