./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0504.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/memsafety/test-0504.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 cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:19:06,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:19:06,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:19:06,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:19:06,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:19:06,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:19:06,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:19:06,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:19:06,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:19:06,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:19:06,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:19:06,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:19:06,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:19:06,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:19:06,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:19:06,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:19:06,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:19:06,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:19:06,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:19:06,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:19:06,858 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:19:06,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:19:06,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:19:06,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:19:06,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:19:06,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:19:06,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:19:06,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:19:06,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:19:06,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:19:06,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:19:06,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:19:06,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:19:06,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:19:06,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:19:06,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:19:06,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:19:06,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:19:06,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:19:06,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:19:06,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:19:06,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:19:06,880 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:19:06,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:19:06,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:19:06,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:19:06,907 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:19:06,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:19:06,908 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:19:06,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:19:06,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:19:06,908 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:19:06,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:19:06,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:19:06,909 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:19:06,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:19:06,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:19:06,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:19:06,910 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:19:06,910 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:19:06,911 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:19:06,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:19:06,911 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:19:06,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:19:06,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:19:06,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:19:06,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:19:06,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:19:06,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:19:06,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:19:06,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:19:06,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:19:06,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:19:06,913 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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2022-07-14 06:19:07,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:19:07,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:19:07,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:19:07,147 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:19:07,147 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:19:07,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0504.i [2022-07-14 06:19:07,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/305d01e1d/b1c3cbdd5d064c0b981644e985db9047/FLAG9c73f5c02 [2022-07-14 06:19:07,627 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:19:07,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0504.i [2022-07-14 06:19:07,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/305d01e1d/b1c3cbdd5d064c0b981644e985db9047/FLAG9c73f5c02 [2022-07-14 06:19:07,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/305d01e1d/b1c3cbdd5d064c0b981644e985db9047 [2022-07-14 06:19:07,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:19:07,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:19:07,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:19:07,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:19:07,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:19:07,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:19:07" (1/1) ... [2022-07-14 06:19:07,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c43ae70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:07, skipping insertion in model container [2022-07-14 06:19:07,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:19:07" (1/1) ... [2022-07-14 06:19:07,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:19:07,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:19:07,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:19:07,918 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:19:07,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:19:08,014 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:19:08,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:08 WrapperNode [2022-07-14 06:19:08,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:19:08,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:19:08,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:19:08,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:19:08,023 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:19:08" (1/1) ... [2022-07-14 06:19:08,046 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:19:08" (1/1) ... [2022-07-14 06:19:08,065 INFO L137 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2022-07-14 06:19:08,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:19:08,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:19:08,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:19:08,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:19:08,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:08" (1/1) ... [2022-07-14 06:19:08,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:08" (1/1) ... [2022-07-14 06:19:08,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:08" (1/1) ... [2022-07-14 06:19:08,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:08" (1/1) ... [2022-07-14 06:19:08,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:08" (1/1) ... [2022-07-14 06:19:08,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:08" (1/1) ... [2022-07-14 06:19:08,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:08" (1/1) ... [2022-07-14 06:19:08,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:19:08,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:19:08,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:19:08,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:19:08,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:08" (1/1) ... [2022-07-14 06:19:08,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:19:08,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:08,139 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:19:08,141 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:19:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:19:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:19:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:19:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:19:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:19:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:19:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:19:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:19:08,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:19:08,241 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:19:08,242 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:19:08,529 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:19:08,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:19:08,535 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-14 06:19:08,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:19:08 BoogieIcfgContainer [2022-07-14 06:19:08,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:19:08,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:19:08,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:19:08,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:19:08,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:19:07" (1/3) ... [2022-07-14 06:19:08,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e87eee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:19:08, skipping insertion in model container [2022-07-14 06:19:08,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:19:08" (2/3) ... [2022-07-14 06:19:08,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e87eee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:19:08, skipping insertion in model container [2022-07-14 06:19:08,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:19:08" (3/3) ... [2022-07-14 06:19:08,548 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0504.i [2022-07-14 06:19:08,558 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:19:08,558 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-07-14 06:19:08,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:19:08,619 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@24c8df34, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b2c2e87 [2022-07-14 06:19:08,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-07-14 06:19:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 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:19:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 06:19:08,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:08,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 06:19:08,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:08,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash 28780379, now seen corresponding path program 1 times [2022-07-14 06:19:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:08,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641299937] [2022-07-14 06:19:08,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:08,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:08,805 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:19:08,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:08,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641299937] [2022-07-14 06:19:08,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641299937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:08,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:08,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:19:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794686613] [2022-07-14 06:19:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:08,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 06:19:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:08,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 06:19:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:19:08,849 INFO L87 Difference]: Start difference. First operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states 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:19:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:08,870 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-07-14 06:19:08,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 06:19:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-14 06:19:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:08,880 INFO L225 Difference]: With dead ends: 87 [2022-07-14 06:19:08,881 INFO L226 Difference]: Without dead ends: 85 [2022-07-14 06:19:08,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:19:08,886 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:08,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:19:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-14 06:19:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-14 06:19:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 44 states have (on average 2.022727272727273) internal successors, (89), 84 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:19:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-07-14 06:19:08,925 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 5 [2022-07-14 06:19:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:08,926 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-07-14 06:19:08,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states 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:19:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-07-14 06:19:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:19:08,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:08,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:19:08,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:19:08,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:08,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash 889572104, now seen corresponding path program 1 times [2022-07-14 06:19:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:08,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307118166] [2022-07-14 06:19:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:09,012 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:19:09,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:09,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307118166] [2022-07-14 06:19:09,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307118166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:09,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:09,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:19:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343596672] [2022-07-14 06:19:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:09,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:19:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:09,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:19:09,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:19:09,017 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:09,064 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2022-07-14 06:19:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:19:09,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:19:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:09,068 INFO L225 Difference]: With dead ends: 133 [2022-07-14 06:19:09,069 INFO L226 Difference]: Without dead ends: 133 [2022-07-14 06:19:09,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:19:09,072 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:09,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:19:09,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-14 06:19:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2022-07-14 06:19:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 108 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2022-07-14 06:19:09,084 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 6 [2022-07-14 06:19:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:09,084 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2022-07-14 06:19:09,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2022-07-14 06:19:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:19:09,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:09,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:19:09,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:19:09,086 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:09,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:09,087 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2022-07-14 06:19:09,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:09,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512920382] [2022-07-14 06:19:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:09,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:09,144 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:19:09,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:09,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512920382] [2022-07-14 06:19:09,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512920382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:09,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:09,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:19:09,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437671589] [2022-07-14 06:19:09,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:09,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:19:09,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:09,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:19:09,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:19:09,149 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:09,253 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2022-07-14 06:19:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:19:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:19:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:09,255 INFO L225 Difference]: With dead ends: 130 [2022-07-14 06:19:09,255 INFO L226 Difference]: Without dead ends: 130 [2022-07-14 06:19:09,256 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:19:09,257 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:09,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-14 06:19:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2022-07-14 06:19:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.8235294117647058) internal successors, (124), 100 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2022-07-14 06:19:09,265 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 6 [2022-07-14 06:19:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:09,265 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2022-07-14 06:19:09,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-07-14 06:19:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:19:09,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:09,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:19:09,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:19:09,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2022-07-14 06:19:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:09,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829179043] [2022-07-14 06:19:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:09,300 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:19:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:09,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829179043] [2022-07-14 06:19:09,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829179043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:09,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:09,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:19:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280212359] [2022-07-14 06:19:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:09,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:19:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:09,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:19:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:19:09,303 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:09,366 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2022-07-14 06:19:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:19:09,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:19:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:09,368 INFO L225 Difference]: With dead ends: 138 [2022-07-14 06:19:09,368 INFO L226 Difference]: Without dead ends: 138 [2022-07-14 06:19:09,368 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:19:09,369 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 47 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:09,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-14 06:19:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2022-07-14 06:19:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2022-07-14 06:19:09,376 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 6 [2022-07-14 06:19:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:09,377 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2022-07-14 06:19:09,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2022-07-14 06:19:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:19:09,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:09,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:09,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:19:09,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:09,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:09,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1806930847, now seen corresponding path program 1 times [2022-07-14 06:19:09,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:09,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327968767] [2022-07-14 06:19:09,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:09,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:09,396 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:19:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:09,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327968767] [2022-07-14 06:19:09,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327968767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:09,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:09,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:19:09,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260379765] [2022-07-14 06:19:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:09,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:19:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:09,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:19:09,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:19:09,399 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:09,441 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2022-07-14 06:19:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:19:09,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:19:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:09,443 INFO L225 Difference]: With dead ends: 103 [2022-07-14 06:19:09,443 INFO L226 Difference]: Without dead ends: 100 [2022-07-14 06:19:09,444 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:19:09,445 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:09,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:19:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-14 06:19:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-14 06:19:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 99 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2022-07-14 06:19:09,451 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 7 [2022-07-14 06:19:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:09,452 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2022-07-14 06:19:09,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2022-07-14 06:19:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:19:09,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:09,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:09,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:19:09,453 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:09,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1857997403, now seen corresponding path program 1 times [2022-07-14 06:19:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:09,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602527335] [2022-07-14 06:19:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:09,644 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:19:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:09,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602527335] [2022-07-14 06:19:09,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602527335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:09,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:09,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:19:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224435978] [2022-07-14 06:19:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:19:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:19:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:19:09,649 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 5 states, 4 states have (on average 3.75) 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:19:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:09,756 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2022-07-14 06:19:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:19:09,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) 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:19:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:09,758 INFO L225 Difference]: With dead ends: 126 [2022-07-14 06:19:09,758 INFO L226 Difference]: Without dead ends: 126 [2022-07-14 06:19:09,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:19:09,760 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 117 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:09,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 69 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-14 06:19:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2022-07-14 06:19:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 91 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:19:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2022-07-14 06:19:09,777 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 15 [2022-07-14 06:19:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:09,778 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2022-07-14 06:19:09,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) 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:19:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-07-14 06:19:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:19:09,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:09,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:09,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:19:09,779 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344638, now seen corresponding path program 1 times [2022-07-14 06:19:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:09,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078500317] [2022-07-14 06:19:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:09,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:09,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:19:09,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:09,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078500317] [2022-07-14 06:19:09,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078500317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:09,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:09,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:19:09,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879245461] [2022-07-14 06:19:09,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:09,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:19:09,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:09,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:19:09,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:19:09,853 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:09,901 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2022-07-14 06:19:09,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:19:09,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:19:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:09,902 INFO L225 Difference]: With dead ends: 88 [2022-07-14 06:19:09,903 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 06:19:09,903 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:19:09,904 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:09,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:19:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 06:19:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-14 06:19:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 87 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:19:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-07-14 06:19:09,907 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 16 [2022-07-14 06:19:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:09,907 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-07-14 06:19:09,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-07-14 06:19:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:19:09,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:09,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:09,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:19:09,910 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344639, now seen corresponding path program 1 times [2022-07-14 06:19:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:09,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653634913] [2022-07-14 06:19:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:09,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:09,964 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:19:09,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:09,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653634913] [2022-07-14 06:19:09,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653634913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:09,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:09,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:19:09,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664249217] [2022-07-14 06:19:09,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:09,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:19:09,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:09,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:19:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:19:09,966 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:10,001 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-07-14 06:19:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:19:10,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:19:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:10,003 INFO L225 Difference]: With dead ends: 84 [2022-07-14 06:19:10,003 INFO L226 Difference]: Without dead ends: 84 [2022-07-14 06:19:10,003 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:19:10,004 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:10,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:19:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-14 06:19:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-14 06:19:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-07-14 06:19:10,011 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2022-07-14 06:19:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:10,012 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-07-14 06:19:10,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-07-14 06:19:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:19:10,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:10,013 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:10,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:19:10,013 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864768, now seen corresponding path program 1 times [2022-07-14 06:19:10,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:10,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628059182] [2022-07-14 06:19:10,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:10,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:10,054 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:19:10,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:10,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628059182] [2022-07-14 06:19:10,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628059182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:10,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:10,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:19:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538108815] [2022-07-14 06:19:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:10,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:19:10,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:19:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:19:10,057 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:10,150 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-07-14 06:19:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:19:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:19:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:10,151 INFO L225 Difference]: With dead ends: 114 [2022-07-14 06:19:10,152 INFO L226 Difference]: Without dead ends: 114 [2022-07-14 06:19:10,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:19:10,152 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:10,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 84 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-14 06:19:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2022-07-14 06:19:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2022-07-14 06:19:10,155 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2022-07-14 06:19:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:10,155 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2022-07-14 06:19:10,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2022-07-14 06:19:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:19:10,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:10,156 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:10,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:19:10,156 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864767, now seen corresponding path program 1 times [2022-07-14 06:19:10,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:10,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386442427] [2022-07-14 06:19:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:10,206 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:19:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:10,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386442427] [2022-07-14 06:19:10,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386442427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:10,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:10,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:19:10,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420432196] [2022-07-14 06:19:10,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:10,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:19:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:10,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:19:10,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:19:10,208 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:10,300 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-07-14 06:19:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:19:10,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:19:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:10,301 INFO L225 Difference]: With dead ends: 153 [2022-07-14 06:19:10,301 INFO L226 Difference]: Without dead ends: 153 [2022-07-14 06:19:10,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:19:10,302 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:10,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-14 06:19:10,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 109. [2022-07-14 06:19:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 108 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:19:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2022-07-14 06:19:10,314 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 18 [2022-07-14 06:19:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:10,314 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2022-07-14 06:19:10,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2022-07-14 06:19:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:19:10,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:10,315 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:10,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:19:10,315 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:10,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash -874266265, now seen corresponding path program 1 times [2022-07-14 06:19:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:10,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840802167] [2022-07-14 06:19:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:10,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:10,353 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:19:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:10,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840802167] [2022-07-14 06:19:10,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840802167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:10,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:10,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:19:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984744451] [2022-07-14 06:19:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:10,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:19:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:19:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:19:10,356 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:19:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:10,411 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2022-07-14 06:19:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:19:10,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:19:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:10,413 INFO L225 Difference]: With dead ends: 113 [2022-07-14 06:19:10,413 INFO L226 Difference]: Without dead ends: 113 [2022-07-14 06:19:10,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:19:10,414 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 89 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:10,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:19:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-14 06:19:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2022-07-14 06:19:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-07-14 06:19:10,417 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 19 [2022-07-14 06:19:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:10,417 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-07-14 06:19:10,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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:19:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-07-14 06:19:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:19:10,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:10,418 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:19:10,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:19:10,419 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:10,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:10,419 INFO L85 PathProgramCache]: Analyzing trace with hash 55140128, now seen corresponding path program 1 times [2022-07-14 06:19:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:10,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087606353] [2022-07-14 06:19:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:10,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:10,477 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:19:10,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:10,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087606353] [2022-07-14 06:19:10,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087606353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:10,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:10,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:19:10,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696233479] [2022-07-14 06:19:10,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:10,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:19:10,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:10,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:19:10,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:19:10,479 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:19:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:10,610 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2022-07-14 06:19:10,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:19:10,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:19:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:10,611 INFO L225 Difference]: With dead ends: 170 [2022-07-14 06:19:10,611 INFO L226 Difference]: Without dead ends: 170 [2022-07-14 06:19:10,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:19:10,612 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:10,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-14 06:19:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2022-07-14 06:19:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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:19:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2022-07-14 06:19:10,615 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 19 [2022-07-14 06:19:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:10,615 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2022-07-14 06:19:10,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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:19:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2022-07-14 06:19:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:19:10,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:10,616 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:19:10,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:19:10,616 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:10,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash 55140129, now seen corresponding path program 1 times [2022-07-14 06:19:10,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:10,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036046242] [2022-07-14 06:19:10,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:10,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:10,814 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:19:10,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:10,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036046242] [2022-07-14 06:19:10,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036046242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:10,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:10,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:19:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580519486] [2022-07-14 06:19:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:10,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:19:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:10,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:19:10,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:19:10,816 INFO L87 Difference]: Start difference. First operand 120 states and 135 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:19:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:11,138 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2022-07-14 06:19:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:19:11,138 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:19:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:11,139 INFO L225 Difference]: With dead ends: 184 [2022-07-14 06:19:11,139 INFO L226 Difference]: Without dead ends: 184 [2022-07-14 06:19:11,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:19:11,140 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 162 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:11,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 195 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:19:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-14 06:19:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 120. [2022-07-14 06:19:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 119 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:19:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2022-07-14 06:19:11,143 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 19 [2022-07-14 06:19:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:11,143 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2022-07-14 06:19:11,144 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:19:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2022-07-14 06:19:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:19:11,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:11,144 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:11,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:19:11,144 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429407, now seen corresponding path program 1 times [2022-07-14 06:19:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:11,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287829980] [2022-07-14 06:19:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:11,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:19:11,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:11,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287829980] [2022-07-14 06:19:11,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287829980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:11,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:11,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:19:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99326684] [2022-07-14 06:19:11,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:11,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:19:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:11,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:19:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:19:11,187 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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:19:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:11,249 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-07-14 06:19:11,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:19:11,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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 20 [2022-07-14 06:19:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:11,251 INFO L225 Difference]: With dead ends: 135 [2022-07-14 06:19:11,251 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 06:19:11,251 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:19:11,252 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:11,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 06:19:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2022-07-14 06:19:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2022-07-14 06:19:11,256 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 20 [2022-07-14 06:19:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:11,256 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2022-07-14 06:19:11,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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:19:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2022-07-14 06:19:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:19:11,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:11,257 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:11,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:19:11,257 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:11,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429406, now seen corresponding path program 1 times [2022-07-14 06:19:11,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:11,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756455748] [2022-07-14 06:19:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:11,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:11,311 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:19:11,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:11,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756455748] [2022-07-14 06:19:11,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756455748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:11,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:11,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:19:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931641240] [2022-07-14 06:19:11,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:11,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:19:11,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:11,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:19:11,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:19:11,314 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:19:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:11,448 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2022-07-14 06:19:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:19:11,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 06:19:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:11,450 INFO L225 Difference]: With dead ends: 194 [2022-07-14 06:19:11,450 INFO L226 Difference]: Without dead ends: 194 [2022-07-14 06:19:11,450 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:19:11,451 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:11,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 132 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-14 06:19:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2022-07-14 06:19:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 134 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2022-07-14 06:19:11,455 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 20 [2022-07-14 06:19:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:11,455 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2022-07-14 06:19:11,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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:19:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2022-07-14 06:19:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:19:11,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:11,456 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] [2022-07-14 06:19:11,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:19:11,457 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:11,457 INFO L85 PathProgramCache]: Analyzing trace with hash -316635569, now seen corresponding path program 1 times [2022-07-14 06:19:11,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:11,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092456324] [2022-07-14 06:19:11,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:11,520 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:19:11,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:11,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092456324] [2022-07-14 06:19:11,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092456324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:11,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:11,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:19:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229763335] [2022-07-14 06:19:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:11,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:19:11,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:11,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:19:11,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:19:11,525 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:11,720 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2022-07-14 06:19:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:19:11,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:19:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:11,722 INFO L225 Difference]: With dead ends: 200 [2022-07-14 06:19:11,722 INFO L226 Difference]: Without dead ends: 200 [2022-07-14 06:19:11,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:19:11,722 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 83 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:11,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 225 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-14 06:19:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 144. [2022-07-14 06:19:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.328125) internal successors, (170), 143 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:19:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2022-07-14 06:19:11,726 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 23 [2022-07-14 06:19:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:11,726 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2022-07-14 06:19:11,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2022-07-14 06:19:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:19:11,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:11,727 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] [2022-07-14 06:19:11,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:19:11,727 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:11,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash -316635568, now seen corresponding path program 1 times [2022-07-14 06:19:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:11,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499413335] [2022-07-14 06:19:11,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:11,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:11,840 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:19:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:11,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499413335] [2022-07-14 06:19:11,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499413335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:11,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:11,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:19:11,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701735241] [2022-07-14 06:19:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:11,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:19:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:11,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:19:11,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:19:11,847 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:12,024 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2022-07-14 06:19:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:19:12,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:19:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:12,025 INFO L225 Difference]: With dead ends: 195 [2022-07-14 06:19:12,025 INFO L226 Difference]: Without dead ends: 195 [2022-07-14 06:19:12,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:19:12,026 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 93 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:12,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 236 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-14 06:19:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2022-07-14 06:19:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.31496062992126) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:19:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2022-07-14 06:19:12,029 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 23 [2022-07-14 06:19:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:12,029 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2022-07-14 06:19:12,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2022-07-14 06:19:12,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:19:12,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:12,030 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:19:12,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 06:19:12,030 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:12,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1225769432, now seen corresponding path program 1 times [2022-07-14 06:19:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:12,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017701219] [2022-07-14 06:19:12,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:12,088 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:19:12,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:12,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017701219] [2022-07-14 06:19:12,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017701219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:12,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:12,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:19:12,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769751681] [2022-07-14 06:19:12,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:12,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:19:12,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:19:12,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:19:12,090 INFO L87 Difference]: Start difference. First operand 143 states and 167 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:19:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:12,190 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2022-07-14 06:19:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:19:12,190 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:19:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:12,191 INFO L225 Difference]: With dead ends: 167 [2022-07-14 06:19:12,191 INFO L226 Difference]: Without dead ends: 167 [2022-07-14 06:19:12,191 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:19:12,192 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:12,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 148 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-14 06:19:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2022-07-14 06:19:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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:19:12,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2022-07-14 06:19:12,196 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 24 [2022-07-14 06:19:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:12,196 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2022-07-14 06:19:12,196 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:19:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2022-07-14 06:19:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:19:12,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:12,197 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] [2022-07-14 06:19:12,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:19:12,197 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:12,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1085033438, now seen corresponding path program 1 times [2022-07-14 06:19:12,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:12,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279496888] [2022-07-14 06:19:12,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:12,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:12,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:12,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279496888] [2022-07-14 06:19:12,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279496888] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:12,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009499013] [2022-07-14 06:19:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:12,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:12,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:12,319 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:19:12,320 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:19:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:12,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 06:19:12,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:19:12,527 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 13 treesize of output 9 [2022-07-14 06:19:12,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:12,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 23 treesize of output 22 [2022-07-14 06:19:12,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:12,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:19:12,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:12,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:12,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:12,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 21 treesize of output 20 [2022-07-14 06:19:12,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:12,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:19:12,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:12,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:19:12,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:12,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:19:12,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:12,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:19:12,692 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:19:12,700 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:19:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:12,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:12,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009499013] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:12,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:12,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 9 [2022-07-14 06:19:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762378633] [2022-07-14 06:19:12,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:12,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:19:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:12,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:19:12,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:19:12,822 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:13,006 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2022-07-14 06:19:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:19:13,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:19:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:13,008 INFO L225 Difference]: With dead ends: 186 [2022-07-14 06:19:13,008 INFO L226 Difference]: Without dead ends: 186 [2022-07-14 06:19:13,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:19:13,009 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 199 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:13,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 267 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-14 06:19:13,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2022-07-14 06:19:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 160 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:19:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2022-07-14 06:19:13,013 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 27 [2022-07-14 06:19:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:13,013 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2022-07-14 06:19:13,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2022-07-14 06:19:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:19:13,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:13,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-14 06:19:13,041 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:19:13,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:13,239 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:13,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846143, now seen corresponding path program 1 times [2022-07-14 06:19:13,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:13,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147627738] [2022-07-14 06:19:13,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:13,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:13,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147627738] [2022-07-14 06:19:13,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147627738] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:13,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473426578] [2022-07-14 06:19:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:13,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:13,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:13,316 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:19:13,318 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:19:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:13,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:19:13,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:13,436 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:13,469 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:19:13,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:19:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:13,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:13,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:13,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473426578] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:13,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:13,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-14 06:19:13,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622875017] [2022-07-14 06:19:13,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:13,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:19:13,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:13,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:19:13,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:19:13,623 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:13,706 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2022-07-14 06:19:13,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:19:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:19:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:13,708 INFO L225 Difference]: With dead ends: 181 [2022-07-14 06:19:13,708 INFO L226 Difference]: Without dead ends: 181 [2022-07-14 06:19:13,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:19:13,709 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 137 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:13,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 141 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-14 06:19:13,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-14 06:19:13,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2022-07-14 06:19:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 159 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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:19:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2022-07-14 06:19:13,713 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 27 [2022-07-14 06:19:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:13,713 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2022-07-14 06:19:13,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2022-07-14 06:19:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:19:13,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:13,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-14 06:19:13,742 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:19:13,928 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,SelfDestructingSolverStorable19 [2022-07-14 06:19:13,928 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:13,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846144, now seen corresponding path program 1 times [2022-07-14 06:19:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:13,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557442139] [2022-07-14 06:19:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:14,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557442139] [2022-07-14 06:19:14,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557442139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:14,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697888863] [2022-07-14 06:19:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:14,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:14,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:14,004 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:19:14,006 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:19:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:14,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:19:14,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:14,148 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:14,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:14,248 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:19:14,254 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:14,255 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:19:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:14,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:14,501 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 37 treesize of output 33 [2022-07-14 06:19:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:14,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697888863] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:14,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:14,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-07-14 06:19:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464762010] [2022-07-14 06:19:14,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:14,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:19:14,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:14,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:19:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:19:14,552 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:19:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:14,705 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2022-07-14 06:19:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:19:14,705 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 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:19:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:14,706 INFO L225 Difference]: With dead ends: 180 [2022-07-14 06:19:14,706 INFO L226 Difference]: Without dead ends: 180 [2022-07-14 06:19:14,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:19:14,707 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 316 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:14,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 198 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 155 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2022-07-14 06:19:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-14 06:19:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2022-07-14 06:19:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 158 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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:19:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 191 transitions. [2022-07-14 06:19:14,711 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 191 transitions. Word has length 27 [2022-07-14 06:19:14,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:14,711 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 191 transitions. [2022-07-14 06:19:14,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:19:14,711 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 191 transitions. [2022-07-14 06:19:14,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:19:14,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:14,712 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:19:14,738 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:19:14,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:14,936 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash 723701189, now seen corresponding path program 1 times [2022-07-14 06:19:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:14,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622607201] [2022-07-14 06:19:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:14,988 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:19:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:14,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622607201] [2022-07-14 06:19:14,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622607201] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:14,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803944398] [2022-07-14 06:19:14,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:14,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:14,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:14,990 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:19:14,991 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:19:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:15,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:19:15,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:15,141 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:19:15,161 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:19:15,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:15,215 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:19:15,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803944398] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:15,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:15,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2022-07-14 06:19:15,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214016323] [2022-07-14 06:19:15,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:15,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:19:15,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:15,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:19:15,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:19:15,217 INFO L87 Difference]: Start difference. First operand 159 states and 191 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:15,361 INFO L93 Difference]: Finished difference Result 161 states and 192 transitions. [2022-07-14 06:19:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:19:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-14 06:19:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:15,363 INFO L225 Difference]: With dead ends: 161 [2022-07-14 06:19:15,363 INFO L226 Difference]: Without dead ends: 149 [2022-07-14 06:19:15,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:19:15,363 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:15,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 162 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-07-14 06:19:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-14 06:19:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-07-14 06:19:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 148 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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:19:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2022-07-14 06:19:15,367 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 28 [2022-07-14 06:19:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:15,367 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2022-07-14 06:19:15,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2022-07-14 06:19:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:19:15,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:15,367 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, 1, 1] [2022-07-14 06:19:15,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:15,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:15,576 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:15,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash -28804244, now seen corresponding path program 1 times [2022-07-14 06:19:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:15,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111627303] [2022-07-14 06:19:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:15,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:15,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111627303] [2022-07-14 06:19:15,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111627303] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:15,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636616444] [2022-07-14 06:19:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:15,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:15,763 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:19:15,764 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:19:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:15,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:19:15,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:15,900 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:15,926 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:19:15,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:15,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:15,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:15,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:15,980 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:15,980 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:19:15,987 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:19:16,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-14 06:19:16,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:19:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:16,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:16,312 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 37 treesize of output 33 [2022-07-14 06:19:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:16,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636616444] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:16,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:16,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 5] total 17 [2022-07-14 06:19:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806548576] [2022-07-14 06:19:16,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:16,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 06:19:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:16,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 06:19:16,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:19:16,361 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 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:19:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:16,663 INFO L93 Difference]: Finished difference Result 238 states and 289 transitions. [2022-07-14 06:19:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:19:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 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) Word has length 31 [2022-07-14 06:19:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:16,665 INFO L225 Difference]: With dead ends: 238 [2022-07-14 06:19:16,665 INFO L226 Difference]: Without dead ends: 238 [2022-07-14 06:19:16,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:19:16,666 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 106 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:16,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 253 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 256 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-07-14 06:19:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-14 06:19:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 174. [2022-07-14 06:19:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.3) internal successors, (208), 173 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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:19:16,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2022-07-14 06:19:16,670 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 31 [2022-07-14 06:19:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:16,670 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2022-07-14 06:19:16,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 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:19:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2022-07-14 06:19:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:19:16,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:16,671 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:16,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:16,871 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,SelfDestructingSolverStorable22 [2022-07-14 06:19:16,872 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash 36474197, now seen corresponding path program 1 times [2022-07-14 06:19:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:16,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546231806] [2022-07-14 06:19:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:16,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546231806] [2022-07-14 06:19:16,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546231806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:16,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301422921] [2022-07-14 06:19:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:16,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:16,948 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:19:16,955 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:19:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:17,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:19:17,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:17,094 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:17,107 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:19:17,123 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-14 06:19:17,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-14 06:19:17,160 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 06:19:17,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-07-14 06:19:17,190 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:19:17,190 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 36 treesize of output 16 [2022-07-14 06:19:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:17,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:17,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301422921] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:17,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:17,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 06:19:17,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056951324] [2022-07-14 06:19:17,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:17,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:19:17,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:19:17,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:19:17,296 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 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:19:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:17,450 INFO L93 Difference]: Finished difference Result 192 states and 227 transitions. [2022-07-14 06:19:17,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:19:17,451 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-14 06:19:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:17,451 INFO L225 Difference]: With dead ends: 192 [2022-07-14 06:19:17,451 INFO L226 Difference]: Without dead ends: 192 [2022-07-14 06:19:17,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:19:17,452 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 65 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:17,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 303 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 208 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2022-07-14 06:19:17,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-14 06:19:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 173. [2022-07-14 06:19:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 160 states have (on average 1.2875) internal successors, (206), 172 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:19:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 206 transitions. [2022-07-14 06:19:17,456 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 206 transitions. Word has length 32 [2022-07-14 06:19:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:17,456 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 206 transitions. [2022-07-14 06:19:17,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 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:19:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 206 transitions. [2022-07-14 06:19:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:19:17,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:17,457 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:17,484 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:19:17,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:17,668 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash 36474198, now seen corresponding path program 1 times [2022-07-14 06:19:17,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:17,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571049829] [2022-07-14 06:19:17,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:17,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:17,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571049829] [2022-07-14 06:19:17,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571049829] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:17,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859836419] [2022-07-14 06:19:17,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:17,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:17,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:17,811 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:19:17,812 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:19:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:17,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-14 06:19:17,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:17,971 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:18,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:19:18,023 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:19:18,062 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:19:18,063 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 15 treesize of output 15 [2022-07-14 06:19:18,067 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 22 treesize of output 24 [2022-07-14 06:19:18,125 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 06:19:18,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2022-07-14 06:19:18,137 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 06:19:18,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 30 [2022-07-14 06:19:18,193 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:19:18,193 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 42 treesize of output 22 [2022-07-14 06:19:18,201 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:19:18,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 17 [2022-07-14 06:19:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:18,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:18,454 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 37 treesize of output 33 [2022-07-14 06:19:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:18,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859836419] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:18,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:18,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-07-14 06:19:18,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787704598] [2022-07-14 06:19:18,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:18,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:19:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:19:18,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:19:18,570 INFO L87 Difference]: Start difference. First operand 173 states and 206 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 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:19:18,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:18,917 INFO L93 Difference]: Finished difference Result 243 states and 289 transitions. [2022-07-14 06:19:18,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:19:18,917 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 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) Word has length 32 [2022-07-14 06:19:18,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:18,918 INFO L225 Difference]: With dead ends: 243 [2022-07-14 06:19:18,918 INFO L226 Difference]: Without dead ends: 243 [2022-07-14 06:19:18,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2022-07-14 06:19:18,919 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 146 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:18,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 500 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 314 Invalid, 0 Unknown, 144 Unchecked, 0.2s Time] [2022-07-14 06:19:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-14 06:19:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 164. [2022-07-14 06:19:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 163 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:19:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2022-07-14 06:19:18,923 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 32 [2022-07-14 06:19:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:18,923 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2022-07-14 06:19:18,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 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:19:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2022-07-14 06:19:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:19:18,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:18,924 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, 1, 1, 1, 1] [2022-07-14 06:19:18,955 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:19:19,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:19,136 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:19,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1911073267, now seen corresponding path program 1 times [2022-07-14 06:19:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:19,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278050168] [2022-07-14 06:19:19,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:19,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:19,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278050168] [2022-07-14 06:19:19,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278050168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:19,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612543529] [2022-07-14 06:19:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:19,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:19,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:19,280 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:19:19,308 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:19:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:19,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:19:19,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:19:19,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:19:19,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612543529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:19,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:19:19,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-07-14 06:19:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691619168] [2022-07-14 06:19:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:19,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:19:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:19,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:19:19,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:19:19,512 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:19,647 INFO L93 Difference]: Finished difference Result 178 states and 201 transitions. [2022-07-14 06:19:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:19:19,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-14 06:19:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:19,648 INFO L225 Difference]: With dead ends: 178 [2022-07-14 06:19:19,648 INFO L226 Difference]: Without dead ends: 178 [2022-07-14 06:19:19,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:19:19,649 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 116 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:19,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 105 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-14 06:19:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2022-07-14 06:19:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 152 states have (on average 1.2763157894736843) internal successors, (194), 163 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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:19:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2022-07-14 06:19:19,653 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 33 [2022-07-14 06:19:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:19,654 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2022-07-14 06:19:19,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2022-07-14 06:19:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:19:19,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:19,655 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:19,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:19,875 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,SelfDestructingSolverStorable25 [2022-07-14 06:19:19,875 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827474, now seen corresponding path program 1 times [2022-07-14 06:19:19,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:19,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114823243] [2022-07-14 06:19:19,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:19,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:19:19,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:19,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114823243] [2022-07-14 06:19:19,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114823243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:19,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:19,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:19:19,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725500014] [2022-07-14 06:19:19,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:19,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:19:19,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:19,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:19:19,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:19:19,922 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:19,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:19,972 INFO L93 Difference]: Finished difference Result 170 states and 192 transitions. [2022-07-14 06:19:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:19:19,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:19:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:19,974 INFO L225 Difference]: With dead ends: 170 [2022-07-14 06:19:19,974 INFO L226 Difference]: Without dead ends: 170 [2022-07-14 06:19:19,974 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:19:19,975 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 104 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:19,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 97 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:19:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-14 06:19:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 135. [2022-07-14 06:19:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 123 states have (on average 1.2520325203252032) internal successors, (154), 134 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2022-07-14 06:19:19,978 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 36 [2022-07-14 06:19:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:19,978 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2022-07-14 06:19:19,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2022-07-14 06:19:19,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:19:19,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:19,978 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:19,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 06:19:19,979 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827524, now seen corresponding path program 1 times [2022-07-14 06:19:19,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:19,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89675416] [2022-07-14 06:19:19,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:19,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:20,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:20,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89675416] [2022-07-14 06:19:20,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89675416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:20,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:20,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:19:20,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755715894] [2022-07-14 06:19:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:20,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:19:20,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:20,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:19:20,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:19:20,037 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:20,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:20,220 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2022-07-14 06:19:20,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:19:20,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:19:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:20,221 INFO L225 Difference]: With dead ends: 176 [2022-07-14 06:19:20,221 INFO L226 Difference]: Without dead ends: 176 [2022-07-14 06:19:20,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:19:20,221 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:20,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 167 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:19:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-14 06:19:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 148. [2022-07-14 06:19:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 136 states have (on average 1.2647058823529411) internal successors, (172), 147 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2022-07-14 06:19:20,225 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 36 [2022-07-14 06:19:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:20,225 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2022-07-14 06:19:20,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:20,225 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2022-07-14 06:19:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:19:20,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:20,226 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:20,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 06:19:20,226 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:20,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827525, now seen corresponding path program 1 times [2022-07-14 06:19:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:20,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31402109] [2022-07-14 06:19:20,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:20,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31402109] [2022-07-14 06:19:20,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31402109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:20,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:20,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:19:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862202634] [2022-07-14 06:19:20,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:20,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:19:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:19:20,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:19:20,315 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:20,564 INFO L93 Difference]: Finished difference Result 222 states and 250 transitions. [2022-07-14 06:19:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:19:20,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-14 06:19:20,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:20,565 INFO L225 Difference]: With dead ends: 222 [2022-07-14 06:19:20,565 INFO L226 Difference]: Without dead ends: 222 [2022-07-14 06:19:20,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:19:20,566 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 128 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:20,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 249 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:19:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-14 06:19:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 148. [2022-07-14 06:19:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2022-07-14 06:19:20,569 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 36 [2022-07-14 06:19:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:20,569 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2022-07-14 06:19:20,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2022-07-14 06:19:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:19:20,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:20,570 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:20,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 06:19:20,570 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:20,570 INFO L85 PathProgramCache]: Analyzing trace with hash 904979977, now seen corresponding path program 1 times [2022-07-14 06:19:20,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:20,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180797154] [2022-07-14 06:19:20,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:20,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:20,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180797154] [2022-07-14 06:19:20,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180797154] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:20,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277113493] [2022-07-14 06:19:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:20,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:20,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:20,850 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:19:20,851 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:19:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:21,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-14 06:19:21,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:21,018 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:21,033 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:19:21,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:21,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:21,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:21,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:21,114 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:21,115 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:19:21,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:19:21,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:19:21,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:19:21,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:19:21,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:19:21,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:21,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:21,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 14 treesize of output 16 [2022-07-14 06:19:21,357 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:19:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:21,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:21,415 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-14 06:19:21,416 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 16 treesize of output 15 [2022-07-14 06:19:21,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1787) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) is different from false [2022-07-14 06:19:21,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_1786)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1787) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) is different from false [2022-07-14 06:19:21,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1784 (Array Int Int)) (v_ArrVal_1786 Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1784))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_1786))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1787) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|)) is different from false [2022-07-14 06:19:22,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_40| Int) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1784 (Array Int Int)) (|v_ULTIMATE.start_main_~last~0#1.offset_15| Int) (v_ArrVal_1786 Int) (v_ArrVal_1778 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_40|) 0)) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_1778)) |v_ULTIMATE.start_main_~x~0#1.base_40| v_ArrVal_1784))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |v_ULTIMATE.start_main_~last~0#1.offset_15| 12) v_ArrVal_1786))) |v_ULTIMATE.start_main_~x~0#1.base_40| v_ArrVal_1787) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~last~0#1.offset_15|)))) is different from false [2022-07-14 06:19:22,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_40| Int) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1784 (Array Int Int)) (|v_ULTIMATE.start_main_~last~0#1.offset_15| Int) (v_ArrVal_1776 Int) (v_ArrVal_1786 Int) (v_ArrVal_1778 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_40|) 0)) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_1776) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_1778)) |v_ULTIMATE.start_main_~x~0#1.base_40| v_ArrVal_1784))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |v_ULTIMATE.start_main_~last~0#1.offset_15| 12) v_ArrVal_1786))) |v_ULTIMATE.start_main_~x~0#1.base_40| v_ArrVal_1787) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~last~0#1.offset_15|)))) is different from false [2022-07-14 06:19:22,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:22,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:22,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:22,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:22,045 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-07-14 06:19:22,049 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 70 treesize of output 66 [2022-07-14 06:19:22,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:22,054 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 22 [2022-07-14 06:19:22,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:22,058 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 32 treesize of output 28 [2022-07-14 06:19:22,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:19:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-14 06:19:22,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277113493] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:22,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:22,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 32 [2022-07-14 06:19:22,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25543606] [2022-07-14 06:19:22,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:22,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 06:19:22,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:22,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 06:19:22,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=623, Unknown=7, NotChecked=270, Total=992 [2022-07-14 06:19:22,086 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 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:19:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:23,007 INFO L93 Difference]: Finished difference Result 234 states and 269 transitions. [2022-07-14 06:19:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 06:19:23,008 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 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) Word has length 38 [2022-07-14 06:19:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:23,009 INFO L225 Difference]: With dead ends: 234 [2022-07-14 06:19:23,009 INFO L226 Difference]: Without dead ends: 234 [2022-07-14 06:19:23,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=288, Invalid=1794, Unknown=8, NotChecked=460, Total=2550 [2022-07-14 06:19:23,011 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 145 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 691 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:23,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 568 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 553 Invalid, 0 Unknown, 691 Unchecked, 0.3s Time] [2022-07-14 06:19:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-14 06:19:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 169. [2022-07-14 06:19:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 157 states have (on average 1.2356687898089171) internal successors, (194), 168 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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:19:23,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2022-07-14 06:19:23,015 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 38 [2022-07-14 06:19:23,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:23,015 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2022-07-14 06:19:23,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 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:19:23,015 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2022-07-14 06:19:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:19:23,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:23,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:23,041 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:19:23,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:23,231 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2113196924, now seen corresponding path program 1 times [2022-07-14 06:19:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:23,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867464392] [2022-07-14 06:19:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:23,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:23,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867464392] [2022-07-14 06:19:23,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867464392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:23,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:23,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:19:23,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095711990] [2022-07-14 06:19:23,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:23,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:19:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:23,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:19:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:19:23,294 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:19:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:23,566 INFO L93 Difference]: Finished difference Result 286 states and 318 transitions. [2022-07-14 06:19:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:19:23,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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:19:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:23,567 INFO L225 Difference]: With dead ends: 286 [2022-07-14 06:19:23,567 INFO L226 Difference]: Without dead ends: 286 [2022-07-14 06:19:23,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:19:23,568 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 286 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:23,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 417 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:19:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-14 06:19:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 171. [2022-07-14 06:19:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 159 states have (on average 1.2327044025157232) internal successors, (196), 170 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:19:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2022-07-14 06:19:23,572 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 38 [2022-07-14 06:19:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:23,573 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2022-07-14 06:19:23,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:19:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2022-07-14 06:19:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 06:19:23,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:23,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:23,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 06:19:23,574 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1084595048, now seen corresponding path program 1 times [2022-07-14 06:19:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:23,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12982164] [2022-07-14 06:19:23,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:23,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:23,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12982164] [2022-07-14 06:19:23,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12982164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:23,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:23,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:19:23,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440001250] [2022-07-14 06:19:23,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:23,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:19:23,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:23,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:19:23,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:19:23,644 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:23,950 INFO L93 Difference]: Finished difference Result 283 states and 315 transitions. [2022-07-14 06:19:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:19:23,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-14 06:19:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:23,952 INFO L225 Difference]: With dead ends: 283 [2022-07-14 06:19:23,952 INFO L226 Difference]: Without dead ends: 283 [2022-07-14 06:19:23,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:19:23,953 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 192 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:23,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 347 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:19:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-14 06:19:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 172. [2022-07-14 06:19:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 160 states have (on average 1.23125) internal successors, (197), 171 states have internal predecessors, (197), 0 states have call successors, (0), 0 states 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:19:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 197 transitions. [2022-07-14 06:19:23,957 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 197 transitions. Word has length 39 [2022-07-14 06:19:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:23,957 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 197 transitions. [2022-07-14 06:19:23,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 197 transitions. [2022-07-14 06:19:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 06:19:23,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:23,958 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, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:23,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-14 06:19:23,958 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:23,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash 693362007, now seen corresponding path program 1 times [2022-07-14 06:19:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:23,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071387643] [2022-07-14 06:19:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:24,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:24,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071387643] [2022-07-14 06:19:24,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071387643] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:24,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576374155] [2022-07-14 06:19:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:24,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:24,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:24,025 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:19:24,027 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:19:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:24,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-14 06:19:24,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:24,183 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:24,213 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:24,213 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:19:24,242 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:19:24,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:24,280 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 16 treesize of output 16 [2022-07-14 06:19:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:24,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:24,401 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 11 treesize of output 9 [2022-07-14 06:19:24,402 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 20 treesize of output 18 [2022-07-14 06:19:24,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:24,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576374155] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:24,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:24,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2022-07-14 06:19:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582069324] [2022-07-14 06:19:24,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:24,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:19:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:24,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:19:24,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-07-14 06:19:24,555 INFO L87 Difference]: Start difference. First operand 172 states and 197 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:25,115 INFO L93 Difference]: Finished difference Result 260 states and 288 transitions. [2022-07-14 06:19:25,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:19:25,116 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-14 06:19:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:25,117 INFO L225 Difference]: With dead ends: 260 [2022-07-14 06:19:25,117 INFO L226 Difference]: Without dead ends: 260 [2022-07-14 06:19:25,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-07-14 06:19:25,118 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 307 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:25,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 575 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 698 Invalid, 0 Unknown, 35 Unchecked, 0.3s Time] [2022-07-14 06:19:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-14 06:19:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 172. [2022-07-14 06:19:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 160 states have (on average 1.225) internal successors, (196), 171 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:19:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2022-07-14 06:19:25,121 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 40 [2022-07-14 06:19:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:25,122 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2022-07-14 06:19:25,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2022-07-14 06:19:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 06:19:25,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:25,122 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:25,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:25,323 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,SelfDestructingSolverStorable32 [2022-07-14 06:19:25,323 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash 737292038, now seen corresponding path program 1 times [2022-07-14 06:19:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:25,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972869719] [2022-07-14 06:19:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:25,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:19:25,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972869719] [2022-07-14 06:19:25,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972869719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:25,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:25,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:19:25,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800635339] [2022-07-14 06:19:25,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:25,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:19:25,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:25,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:19:25,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:19:25,369 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:19:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:25,419 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2022-07-14 06:19:25,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:19:25,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 40 [2022-07-14 06:19:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:25,420 INFO L225 Difference]: With dead ends: 171 [2022-07-14 06:19:25,420 INFO L226 Difference]: Without dead ends: 171 [2022-07-14 06:19:25,420 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:19:25,421 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:25,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:19:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-14 06:19:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-14 06:19:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 160 states have (on average 1.2125) internal successors, (194), 170 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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:19:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 194 transitions. [2022-07-14 06:19:25,424 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 194 transitions. Word has length 40 [2022-07-14 06:19:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:25,424 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 194 transitions. [2022-07-14 06:19:25,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:19:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 194 transitions. [2022-07-14 06:19:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 06:19:25,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:25,425 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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:19:25,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-14 06:19:25,425 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:25,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179932, now seen corresponding path program 1 times [2022-07-14 06:19:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:25,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088659414] [2022-07-14 06:19:25,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:25,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:25,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088659414] [2022-07-14 06:19:25,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088659414] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:25,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932368163] [2022-07-14 06:19:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:25,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:25,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:25,628 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:19:25,629 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:19:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:25,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:19:25,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:25,820 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:25,874 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:19:25,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:19:26,002 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:19:26,040 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:19:26,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:19:26,099 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:19:26,153 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 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 06:19:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:26,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:26,233 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2271 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2271) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) |c_ULTIMATE.start_main_~first~0#1.base|))) (forall ((v_ArrVal_2271 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2271) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) 1))) is different from false [2022-07-14 06:19:26,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:26,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 06:19:26,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:26,260 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 39 treesize of output 42 [2022-07-14 06:19:26,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-07-14 06:19:26,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:26,278 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:19:26,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:26,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:26,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-14 06:19:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:26,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932368163] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:26,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:26,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2022-07-14 06:19:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273703496] [2022-07-14 06:19:26,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:26,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 06:19:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:26,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 06:19:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=465, Unknown=1, NotChecked=44, Total=600 [2022-07-14 06:19:26,433 INFO L87 Difference]: Start difference. First operand 171 states and 194 transitions. Second operand has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 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:19:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:26,985 INFO L93 Difference]: Finished difference Result 255 states and 281 transitions. [2022-07-14 06:19:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:19:26,986 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-14 06:19:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:26,986 INFO L225 Difference]: With dead ends: 255 [2022-07-14 06:19:26,986 INFO L226 Difference]: Without dead ends: 255 [2022-07-14 06:19:26,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=964, Unknown=1, NotChecked=66, Total=1260 [2022-07-14 06:19:26,987 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 243 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:26,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 475 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 700 Invalid, 0 Unknown, 141 Unchecked, 0.4s Time] [2022-07-14 06:19:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-14 06:19:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 225. [2022-07-14 06:19:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 214 states have (on average 1.1962616822429906) internal successors, (256), 224 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:19:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 256 transitions. [2022-07-14 06:19:26,992 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 256 transitions. Word has length 42 [2022-07-14 06:19:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:26,992 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 256 transitions. [2022-07-14 06:19:26,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 25 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:19:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 256 transitions. [2022-07-14 06:19:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 06:19:26,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:26,993 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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:19:27,017 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:19:27,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-14 06:19:27,207 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:27,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179933, now seen corresponding path program 1 times [2022-07-14 06:19:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:27,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70400587] [2022-07-14 06:19:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:27,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:27,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70400587] [2022-07-14 06:19:27,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70400587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:27,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720064422] [2022-07-14 06:19:27,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:27,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:27,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:27,468 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:19:27,469 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:19:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:27,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 06:19:27,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:27,676 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:27,729 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:27,729 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:19:27,845 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 13 treesize of output 9 [2022-07-14 06:19:27,850 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 13 treesize of output 9 [2022-07-14 06:19:27,896 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:19:27,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-14 06:19:27,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 06:19:27,947 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:19:27,950 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:19:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:27,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:28,069 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2432 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2432) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 12))) (forall ((v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2432) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2433) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0)))))) is different from false [2022-07-14 06:19:28,079 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:28,079 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 24 treesize of output 25 [2022-07-14 06:19:28,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:28,085 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 40 treesize of output 43 [2022-07-14 06:19:28,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:19:28,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:28,112 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 45 treesize of output 46 [2022-07-14 06:19:28,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:28,117 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-14 06:19:28,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:28,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:28,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-14 06:19:28,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:28,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:28,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 06:19:28,203 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 8 treesize of output 6 [2022-07-14 06:19:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:28,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720064422] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:28,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:28,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2022-07-14 06:19:28,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391495030] [2022-07-14 06:19:28,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:28,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 06:19:28,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:28,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 06:19:28,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=519, Unknown=1, NotChecked=46, Total=650 [2022-07-14 06:19:28,297 INFO L87 Difference]: Start difference. First operand 225 states and 256 transitions. Second operand has 26 states, 25 states have (on average 4.76) internal successors, (119), 26 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:28,957 INFO L93 Difference]: Finished difference Result 308 states and 348 transitions. [2022-07-14 06:19:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:19:28,957 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.76) internal successors, (119), 26 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-14 06:19:28,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:28,958 INFO L225 Difference]: With dead ends: 308 [2022-07-14 06:19:28,959 INFO L226 Difference]: Without dead ends: 308 [2022-07-14 06:19:28,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=1054, Unknown=2, NotChecked=68, Total=1332 [2022-07-14 06:19:28,959 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 184 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:28,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 629 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 596 Invalid, 0 Unknown, 184 Unchecked, 0.3s Time] [2022-07-14 06:19:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-14 06:19:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 236. [2022-07-14 06:19:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 225 states have (on average 1.2177777777777778) internal successors, (274), 235 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:19:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 274 transitions. [2022-07-14 06:19:28,964 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 274 transitions. Word has length 42 [2022-07-14 06:19:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:28,964 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 274 transitions. [2022-07-14 06:19:28,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.76) internal successors, (119), 26 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 274 transitions. [2022-07-14 06:19:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 06:19:28,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:28,964 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:28,990 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:19:29,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-14 06:19:29,165 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash -131950583, now seen corresponding path program 1 times [2022-07-14 06:19:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:29,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598970814] [2022-07-14 06:19:29,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:29,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:29,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:29,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598970814] [2022-07-14 06:19:29,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598970814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:29,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041640080] [2022-07-14 06:19:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:29,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:29,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:29,514 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:19:29,516 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:19:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:29,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-14 06:19:29,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:29,727 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:19:29,730 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:19:29,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:29,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:29,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:29,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:29,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:29,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:29,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:29,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:29,859 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 06:19:29,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 18 [2022-07-14 06:19:29,877 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 06:19:29,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 18 [2022-07-14 06:19:30,011 INFO L356 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2022-07-14 06:19:30,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2022-07-14 06:19:30,031 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-14 06:19:30,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2022-07-14 06:19:30,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-14 06:19:30,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:19:30,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-14 06:19:30,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:19:30,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:30,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-07-14 06:19:30,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:30,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 32 [2022-07-14 06:19:30,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 31 treesize of output 30 [2022-07-14 06:19:30,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-14 06:19:30,205 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 06:19:30,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2022-07-14 06:19:30,216 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-14 06:19:30,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 40 [2022-07-14 06:19:30,515 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-07-14 06:19:30,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 57 [2022-07-14 06:19:30,535 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-14 06:19:30,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2022-07-14 06:19:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:30,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:31,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:31,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:31,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2587 Int) (v_ArrVal_2589 Int) (v_ArrVal_2590 (Array Int Int))) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_2589)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |c_ULTIMATE.start_main_~y~0#1.base|) 0)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_2587)))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) is different from false [2022-07-14 06:19:31,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:31,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2583 Int) (v_ArrVal_2585 Int) (v_ArrVal_2590 (Array Int Int))) (or (and (forall ((v_ArrVal_2587 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4) v_ArrVal_2585) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_2587)))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~y~0#1.base|))) |c_ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_2589 Int)) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 4) v_ArrVal_2583) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_2589)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |c_ULTIMATE.start_main_~y~0#1.base|) 0)))) (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) is different from false [2022-07-14 06:19:31,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:31,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:31,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:31,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:31,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:31,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:32,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:32,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:32,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:32,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:32,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:32,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2573 Int) (v_ArrVal_2575 Int) (v_ArrVal_2590 (Array Int Int))) (or (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (and (forall ((v_ArrVal_2583 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2589 Int) (v_ArrVal_2580 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (let ((.cse0 (store (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2575)))) (store .cse1 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~y~0#1.base|) 0 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|))))) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2580))) (store .cse0 |ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~y~0#1.base|) 4 v_ArrVal_2583) 8 v_ArrVal_2589))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |ULTIMATE.start_main_~y~0#1.base|) 0))) (forall ((|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2585 Int) (v_ArrVal_2587 Int) (v_ArrVal_2581 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2573)))) (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse6))) .cse6 v_ArrVal_2581))))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) 4 v_ArrVal_2585) 8 v_ArrVal_2587))))) (store .cse3 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2022-07-14 06:19:32,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 06:19:32,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2571 Int) (v_ArrVal_2570 Int) (v_ArrVal_2590 (Array Int Int))) (or (and (forall ((v_ArrVal_2583 Int) (v_ArrVal_2575 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2589 Int) (v_ArrVal_2580 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store (let ((.cse0 (store (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2571) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2575)))) (store .cse1 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~y~0#1.base|) 0 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|))))) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2580))) (store .cse0 |ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~y~0#1.base|) 4 v_ArrVal_2583) 8 v_ArrVal_2589))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2590) |ULTIMATE.start_main_~y~0#1.base|) 0))) (forall ((v_ArrVal_2573 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_2585 Int) (v_ArrVal_2587 Int) (v_ArrVal_2581 (Array Int Int))) (= (select (select (let ((.cse3 (let ((.cse4 (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store .cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2570) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2573)))) (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse6))) .cse6 v_ArrVal_2581))))) (store .cse4 |ULTIMATE.start_main_~y~0#1.base| (store (store (select .cse4 |ULTIMATE.start_main_~y~0#1.base|) 4 v_ArrVal_2585) 8 v_ArrVal_2587))))) (store .cse3 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) |ULTIMATE.start_main_~y~0#1.base|) 0) |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= (select v_ArrVal_2590 |c_ULTIMATE.start_main_~x~0#1.offset|) 0)))) is different from false [2022-07-14 06:19:32,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:32,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:32,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:32,548 INFO L356 Elim1Store]: treesize reduction 73, result has 41.1 percent of original size [2022-07-14 06:19:32,549 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 225 treesize of output 100 [2022-07-14 06:19:32,558 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:32,559 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 210 [2022-07-14 06:19:32,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-14 06:19:32,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:32,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:32,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:32,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:32,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 47 [2022-07-14 06:19:32,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:32,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:32,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:32,601 INFO L356 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2022-07-14 06:19:32,601 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 1 [2022-07-14 06:19:32,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-14 06:19:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:32,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041640080] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:32,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:32,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 22] total 54 [2022-07-14 06:19:32,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093218354] [2022-07-14 06:19:32,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:32,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-14 06:19:32,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:32,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-14 06:19:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1996, Unknown=268, NotChecked=396, Total=2862 [2022-07-14 06:19:32,614 INFO L87 Difference]: Start difference. First operand 236 states and 274 transitions. Second operand has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 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:19:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:36,683 INFO L93 Difference]: Finished difference Result 486 states and 582 transitions. [2022-07-14 06:19:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-14 06:19:36,683 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 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) Word has length 42 [2022-07-14 06:19:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:36,685 INFO L225 Difference]: With dead ends: 486 [2022-07-14 06:19:36,685 INFO L226 Difference]: Without dead ends: 486 [2022-07-14 06:19:36,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=871, Invalid=7016, Unknown=501, NotChecked=732, Total=9120 [2022-07-14 06:19:36,687 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 471 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1080 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:36,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1213 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1537 Invalid, 0 Unknown, 1080 Unchecked, 0.8s Time] [2022-07-14 06:19:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-07-14 06:19:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 246. [2022-07-14 06:19:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2085106382978723) internal successors, (284), 245 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:19:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2022-07-14 06:19:36,693 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 42 [2022-07-14 06:19:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:36,693 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2022-07-14 06:19:36,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 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:19:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2022-07-14 06:19:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:19:36,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:36,694 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1] [2022-07-14 06:19:36,751 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:19:36,894 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,SelfDestructingSolverStorable36 [2022-07-14 06:19:36,895 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1041969739, now seen corresponding path program 1 times [2022-07-14 06:19:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:36,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514258422] [2022-07-14 06:19:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:37,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:37,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514258422] [2022-07-14 06:19:37,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514258422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:37,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142973911] [2022-07-14 06:19:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:37,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:37,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:37,133 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:19:37,185 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:19:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:37,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 06:19:37,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:37,402 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:37,447 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:37,448 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:19:37,561 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:19:37,581 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:19:37,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-14 06:19:37,617 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 24 treesize of output 12 [2022-07-14 06:19:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:37,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:37,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2750 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2750) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0))) is different from false [2022-07-14 06:19:37,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:37,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 06:19:37,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:37,677 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 39 treesize of output 42 [2022-07-14 06:19:37,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 22 treesize of output 18 [2022-07-14 06:19:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:37,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142973911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:37,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:37,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-07-14 06:19:37,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892213370] [2022-07-14 06:19:37,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:37,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 06:19:37,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:37,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 06:19:37,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=200, Unknown=1, NotChecked=28, Total=272 [2022-07-14 06:19:37,854 INFO L87 Difference]: Start difference. First operand 246 states and 284 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:19:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:38,163 INFO L93 Difference]: Finished difference Result 301 states and 338 transitions. [2022-07-14 06:19:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:19:38,163 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 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 43 [2022-07-14 06:19:38,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:38,164 INFO L225 Difference]: With dead ends: 301 [2022-07-14 06:19:38,164 INFO L226 Difference]: Without dead ends: 301 [2022-07-14 06:19:38,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=430, Unknown=1, NotChecked=44, Total=600 [2022-07-14 06:19:38,165 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 155 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:38,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 629 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 415 Invalid, 0 Unknown, 166 Unchecked, 0.2s Time] [2022-07-14 06:19:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-14 06:19:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 246. [2022-07-14 06:19:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 235 states have (on average 1.2) internal successors, (282), 245 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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:19:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2022-07-14 06:19:38,170 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 43 [2022-07-14 06:19:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:38,170 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2022-07-14 06:19:38,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:19:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2022-07-14 06:19:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:19:38,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:38,171 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:38,198 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:19:38,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:38,394 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:19:38,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:38,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2058655426, now seen corresponding path program 1 times [2022-07-14 06:19:38,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:19:38,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902838730] [2022-07-14 06:19:38,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:38,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:19:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:19:38,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902838730] [2022-07-14 06:19:38,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902838730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:38,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322661990] [2022-07-14 06:19:38,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:38,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:19:38,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:19:38,559 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:19:38,588 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:19:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:38,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-14 06:19:38,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:38,806 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:19:38,814 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 13 treesize of output 9 [2022-07-14 06:19:38,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:38,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:19:38,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:38,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:38,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:38,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:19:38,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:38,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:19:38,901 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:38,901 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:19:38,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:19:38,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:19:38,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:19:38,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:19:38,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:19:39,016 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:19:39,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:19:39,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:19:39,086 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 7 treesize of output 3 [2022-07-14 06:19:39,088 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:19:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:39,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:39,145 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:39,146 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 20 treesize of output 24 [2022-07-14 06:19:39,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) is different from false [2022-07-14 06:19:39,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) is different from false [2022-07-14 06:19:39,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int)) (v_ArrVal_2920 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int)) (<= 0 (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2920))) (store .cse0 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.offset|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) is different from false [2022-07-14 06:19:39,585 INFO L356 Elim1Store]: treesize reduction 320, result has 13.3 percent of original size [2022-07-14 06:19:39,585 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 5 case distinctions, treesize of input 84 treesize of output 77 [2022-07-14 06:19:39,588 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 80 treesize of output 76 [2022-07-14 06:19:39,591 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 55 treesize of output 47 [2022-07-14 06:19:39,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 7 treesize of output 3 [2022-07-14 06:19:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-14 06:19:39,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322661990] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:39,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:19:39,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 16] total 32 [2022-07-14 06:19:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499955930] [2022-07-14 06:19:39,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:39,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:19:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:19:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:19:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=729, Unknown=36, NotChecked=174, Total=1056 [2022-07-14 06:19:39,619 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:19:49,301 WARN L233 SmtUtils]: Spent 9.53s on a formula simplification. DAG size of input: 41 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 06:19:57,029 WARN L233 SmtUtils]: Spent 7.70s on a formula simplification. DAG size of input: 37 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 06:20:07,968 WARN L233 SmtUtils]: Spent 10.93s on a formula simplification. DAG size of input: 41 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 06:20:08,401 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12) 12) (not (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) 12) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) 12) 0) (forall ((v_ArrVal_2923 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0)) is different from false [2022-07-14 06:20:08,808 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12) 12) (not (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) 12) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) 12) 0) (forall ((v_ArrVal_2923 (Array Int Int)) (|ULTIMATE.start_main_~last~0#1.offset| Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.offset|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2923) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0)) is different from false [2022-07-14 06:20:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:10,286 INFO L93 Difference]: Finished difference Result 562 states and 626 transitions. [2022-07-14 06:20:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-07-14 06:20:10,286 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 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:20:10,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:10,288 INFO L225 Difference]: With dead ends: 562 [2022-07-14 06:20:10,288 INFO L226 Difference]: Without dead ends: 562 [2022-07-14 06:20:10,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=934, Invalid=4593, Unknown=43, NotChecked=750, Total=6320 [2022-07-14 06:20:10,289 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 696 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 954 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:10,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 828 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1208 Invalid, 0 Unknown, 954 Unchecked, 0.7s Time] [2022-07-14 06:20:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-07-14 06:20:10,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 299. [2022-07-14 06:20:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 288 states have (on average 1.2222222222222223) internal successors, (352), 298 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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:20:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 352 transitions. [2022-07-14 06:20:10,317 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 352 transitions. Word has length 44 [2022-07-14 06:20:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:10,319 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 352 transitions. [2022-07-14 06:20:10,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:20:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 352 transitions. [2022-07-14 06:20:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:20:10,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:10,322 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:20:10,376 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:20:10,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-14 06:20:10,539 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:20:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1393098207, now seen corresponding path program 2 times [2022-07-14 06:20:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:10,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864916910] [2022-07-14 06:20:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:10,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:10,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864916910] [2022-07-14 06:20:10,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864916910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:10,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870594014] [2022-07-14 06:20:10,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:20:10,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:10,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:10,808 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:20:10,817 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:20:11,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:20:11,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:20:11,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:20:11,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:11,050 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:20:11,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:11,104 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:20:11,110 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:20:11,110 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:20:11,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:11,203 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:20:11,211 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:20:11,211 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:20:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:20:11,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:11,626 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:20:11,626 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:20:11,805 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 37 treesize of output 33 [2022-07-14 06:20:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:20:11,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870594014] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:20:11,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:20:11,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 19 [2022-07-14 06:20:11,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23886206] [2022-07-14 06:20:11,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:20:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:20:11,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:11,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:20:11,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-07-14 06:20:11,859 INFO L87 Difference]: Start difference. First operand 299 states and 352 transitions. Second operand has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 20 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:20:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:12,252 INFO L93 Difference]: Finished difference Result 474 states and 567 transitions. [2022-07-14 06:20:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:20:12,253 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 20 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) Word has length 44 [2022-07-14 06:20:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:12,254 INFO L225 Difference]: With dead ends: 474 [2022-07-14 06:20:12,254 INFO L226 Difference]: Without dead ends: 474 [2022-07-14 06:20:12,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2022-07-14 06:20:12,255 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 395 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:12,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 313 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 321 Invalid, 0 Unknown, 51 Unchecked, 0.2s Time] [2022-07-14 06:20:12,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-14 06:20:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 292. [2022-07-14 06:20:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 281 states have (on average 1.2241992882562278) internal successors, (344), 291 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:20:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2022-07-14 06:20:12,261 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 44 [2022-07-14 06:20:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:12,261 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2022-07-14 06:20:12,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 6.315789473684211) internal successors, (120), 20 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:20:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2022-07-14 06:20:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:20:12,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:12,262 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2022-07-14 06:20:12,317 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:20:12,475 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,SelfDestructingSolverStorable39 [2022-07-14 06:20:12,475 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:20:12,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash 489910956, now seen corresponding path program 1 times [2022-07-14 06:20:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:12,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574821919] [2022-07-14 06:20:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:12,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:12,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:12,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574821919] [2022-07-14 06:20:12,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574821919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:12,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754293717] [2022-07-14 06:20:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:12,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:12,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:12,612 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:20:12,615 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:20:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:12,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 06:20:12,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:20:13,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:13,098 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:13,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2022-07-14 06:20:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:20:13,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754293717] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:20:13,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:20:13,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-07-14 06:20:13,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535003504] [2022-07-14 06:20:13,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:20:13,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:20:13,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:13,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:20:13,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:20:13,248 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 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:20:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:13,489 INFO L93 Difference]: Finished difference Result 310 states and 362 transitions. [2022-07-14 06:20:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:20:13,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-14 06:20:13,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:13,497 INFO L225 Difference]: With dead ends: 310 [2022-07-14 06:20:13,497 INFO L226 Difference]: Without dead ends: 310 [2022-07-14 06:20:13,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:20:13,498 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 116 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:13,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 214 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:20:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-14 06:20:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 282. [2022-07-14 06:20:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 271 states have (on average 1.2177121771217712) internal successors, (330), 281 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 330 transitions. [2022-07-14 06:20:13,509 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 330 transitions. Word has length 46 [2022-07-14 06:20:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:13,509 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 330 transitions. [2022-07-14 06:20:13,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 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:20:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 330 transitions. [2022-07-14 06:20:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:20:13,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:13,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:20:13,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:20:13,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:13,723 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:20:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1931630812, now seen corresponding path program 1 times [2022-07-14 06:20:13,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:13,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441213604] [2022-07-14 06:20:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:13,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:14,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:14,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441213604] [2022-07-14 06:20:14,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441213604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:14,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436762641] [2022-07-14 06:20:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:14,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:14,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:14,224 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:20:14,225 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:20:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:14,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-14 06:20:14,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:14,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:20:14,473 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 13 treesize of output 9 [2022-07-14 06:20:14,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:20:14,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:20:14,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:20:14,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:20:14,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:14,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-14 06:20:14,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-14 06:20:14,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:14,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-14 06:20:14,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-14 06:20:14,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,707 INFO L356 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-07-14 06:20:14,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 32 treesize of output 40 [2022-07-14 06:20:14,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,745 INFO L356 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-07-14 06:20:14,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 51 [2022-07-14 06:20:14,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:14,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:15,009 INFO L356 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2022-07-14 06:20:15,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 84 [2022-07-14 06:20:15,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:15,103 INFO L356 Elim1Store]: treesize reduction 72, result has 41.9 percent of original size [2022-07-14 06:20:15,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 83 [2022-07-14 06:20:16,008 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-14 06:20:16,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 124 [2022-07-14 06:20:16,031 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-14 06:20:16,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 112 [2022-07-14 06:20:16,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 7 treesize of output 5 [2022-07-14 06:20:16,335 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 13 treesize of output 9 [2022-07-14 06:20:16,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:16,435 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 0 case distinctions, treesize of input 31 treesize of output 23 [2022-07-14 06:20:16,464 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 13 treesize of output 9 [2022-07-14 06:20:16,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:16,541 INFO L356 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2022-07-14 06:20:16,541 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 86 treesize of output 78 [2022-07-14 06:20:16,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:20:16,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:20:16,857 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:20:16,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 36 [2022-07-14 06:20:16,871 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:20:16,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-07-14 06:20:16,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:16,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-07-14 06:20:16,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:16,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2022-07-14 06:20:17,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:17,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 38 [2022-07-14 06:20:17,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:17,181 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 30 treesize of output 26 [2022-07-14 06:20:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:17,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:36,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4))) (let ((.cse0 (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse5 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse4 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse3 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse4 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (not (<= v_ArrVal_3487 |c_ULTIMATE.start_main_#t~mem7#1.offset|)) (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (= (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2022-07-14 06:20:38,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4))) (let ((.cse0 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse6 .cse4 (store (select .cse6 .cse4) .cse5 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse4)))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) is different from false [2022-07-14 06:20:54,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3476 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3480 Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse0 (select (store (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse6 v_ArrVal_3479) .cse7 v_ArrVal_3483)))) (store .cse9 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse9 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse8 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select (store (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3480) .cse7 v_ArrVal_3486)))) (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse3 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0))) (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))) is different from false [2022-07-14 06:21:02,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3476 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3473 Int) (v_ArrVal_3493 Int) (v_ArrVal_3471 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3480 Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse1 (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse7 v_ArrVal_3479) .cse8 v_ArrVal_3483)))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse9 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select (store (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse6 v_ArrVal_3471) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3480) .cse8 v_ArrVal_3486)))) (store .cse5 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse3 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) .cse4 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse1 .cse2) 0) (= (select .cse0 .cse2) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))) is different from false [2022-07-14 06:21:02,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:02,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,757 INFO L356 Elim1Store]: treesize reduction 183, result has 40.0 percent of original size [2022-07-14 06:21:03,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 454 treesize of output 299 [2022-07-14 06:21:03,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,907 INFO L356 Elim1Store]: treesize reduction 187, result has 38.7 percent of original size [2022-07-14 06:21:03,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 315 treesize of output 156 [2022-07-14 06:21:03,930 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:03,931 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 181 treesize of output 169 [2022-07-14 06:21:03,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:03,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,058 INFO L356 Elim1Store]: treesize reduction 8, result has 92.4 percent of original size [2022-07-14 06:21:04,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 176 treesize of output 246 [2022-07-14 06:21:04,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:04,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 82 treesize of output 86 [2022-07-14 06:21:04,126 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:04,126 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 178 treesize of output 166 [2022-07-14 06:21:04,172 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:04,173 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 64 treesize of output 68 [2022-07-14 06:21:04,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:04,306 INFO L356 Elim1Store]: treesize reduction 8, result has 92.4 percent of original size [2022-07-14 06:21:04,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 156 treesize of output 226 [2022-07-14 06:21:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 06:21:06,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436762641] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:06,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:21:06,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 23] total 50 [2022-07-14 06:21:06,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308440007] [2022-07-14 06:21:06,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:06,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 06:21:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 06:21:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1686, Unknown=193, NotChecked=364, Total=2450 [2022-07-14 06:21:06,410 INFO L87 Difference]: Start difference. First operand 282 states and 330 transitions. Second operand has 50 states, 50 states have (on average 2.2) internal successors, (110), 50 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:21:06,484 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3476 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3473 Int) (v_ArrVal_3493 Int) (v_ArrVal_3471 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3480 Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse2 (select (store (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse8 v_ArrVal_3479) .cse9 v_ArrVal_3483)))) (store .cse11 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse11 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse10 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select (store (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3471) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse8 v_ArrVal_3480) .cse9 v_ArrVal_3486)))) (store .cse6 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse4 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse2 .cse3) 0) (= (select .cse1 .cse3) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))) (= |c_ULTIMATE.start_main_~first~0#1.base| 0) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0))) is different from false [2022-07-14 06:21:06,495 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3476 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3493 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3480 Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse1 (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse7 v_ArrVal_3479) .cse8 v_ArrVal_3483)))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse9 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select (store (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3480) .cse8 v_ArrVal_3486)))) (store .cse6 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse4 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse1 .cse2) 0) (= (select .cse3 .cse2) 0))) (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0))) is different from false [2022-07-14 06:21:06,549 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4))) (let ((.cse0 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse6 .cse4 (store (select .cse6 .cse4) .cse5 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse4)))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) (= (select .cse7 .cse8) 0) (= (select .cse9 |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse9 .cse8) 0))) is different from false [2022-07-14 06:21:06,556 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (let ((.cse7 (= (select .cse13 .cse12) 0)) (.cse8 (= (select .cse13 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse9 (select .cse11 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse10 (= (select .cse11 .cse12) 0))) (and (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4))) (let ((.cse0 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse6 .cse4 (store (select .cse6 .cse4) .cse5 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| .cse4)))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (= (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse0 .cse1) 0) (= (select .cse2 .cse1) 0))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (= (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3487) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)))))) .cse7 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) .cse8 (or (and .cse7 (= .cse9 0) .cse8 .cse10) (= |c_ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (<= .cse9 |c_ULTIMATE.start_main_~x~0#1.offset|) .cse10))) is different from false [2022-07-14 06:21:06,586 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (let ((.cse0 (= (select .cse12 .cse11) 0)) (.cse2 (select .cse12 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (= (select .cse10 .cse11) 0))) (and (or (and (= |c_ULTIMATE.start_main_#t~mem7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (= |c_ULTIMATE.start_main_#t~mem7#1.offset| 0) .cse1) (= |c_ULTIMATE.start_main_~y~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) .cse0 (= .cse2 |c_ULTIMATE.start_main_#t~mem7#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3501 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3494 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int) (v_ArrVal_3493 Int)) (let ((.cse7 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4))) (let ((.cse3 (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487)))) (store .cse8 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse7 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse7 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (not (<= v_ArrVal_3487 |c_ULTIMATE.start_main_#t~mem7#1.offset|)) (not (= (select (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse3 .cse4) 0) (= (select .cse5 .cse4) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (= (select (store .cse5 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))))) (<= |c_ULTIMATE.start_main_#t~mem7#1.offset| .cse9) (<= .cse9 |c_ULTIMATE.start_main_~x~0#1.offset|) .cse1))) is different from false [2022-07-14 06:21:07,649 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (forall ((v_ArrVal_3479 Int) (v_ArrVal_3501 Int) (v_ArrVal_3476 Int) (v_ArrVal_3487 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3483 Int) (v_ArrVal_3494 Int) (v_ArrVal_3473 Int) (v_ArrVal_3493 Int) (v_ArrVal_3471 Int) (|ULTIMATE.start_main_~y~0#1.offset| Int) (v_ArrVal_3480 Int) (v_ArrVal_3497 (Array Int Int)) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_26| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_26| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse8 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse2 (select (store (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3476) .cse8 v_ArrVal_3479) .cse9 v_ArrVal_3483)))) (store .cse11 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse11 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3487))))) (store .cse10 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3493))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select (store (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse7 v_ArrVal_3471) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse8 v_ArrVal_3480) .cse9 v_ArrVal_3486)))) (store .cse6 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse4 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3497) |c_ULTIMATE.start_main_~x~0#1.base|))) (or (not (<= 0 |ULTIMATE.start_main_~x~1#1.offset|)) (= (select (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3501) |ULTIMATE.start_main_~x~1#1.offset|) 0)) (not (<= v_ArrVal_3476 |c_ULTIMATE.start_main_~x~0#1.offset|)) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.offset_26| v_ArrVal_3487)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= (select .cse2 .cse3) 0) (= (select .cse1 .cse3) 0))) (not (<= |ULTIMATE.start_main_~x~1#1.offset| 0)) (< v_ArrVal_3476 v_ArrVal_3487))))))) is different from false [2022-07-14 06:21:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:09,544 INFO L93 Difference]: Finished difference Result 344 states and 396 transitions. [2022-07-14 06:21:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-14 06:21:09,544 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.2) internal successors, (110), 50 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) Word has length 46 [2022-07-14 06:21:09,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:09,545 INFO L225 Difference]: With dead ends: 344 [2022-07-14 06:21:09,545 INFO L226 Difference]: Without dead ends: 344 [2022-07-14 06:21:09,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=363, Invalid=2841, Unknown=258, NotChecked=1230, Total=4692 [2022-07-14 06:21:09,546 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 124 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 632 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:09,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 801 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 517 Invalid, 0 Unknown, 632 Unchecked, 0.3s Time] [2022-07-14 06:21:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-14 06:21:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 286. [2022-07-14 06:21:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 275 states have (on average 1.2145454545454546) internal successors, (334), 285 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 334 transitions. [2022-07-14 06:21:09,551 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 334 transitions. Word has length 46 [2022-07-14 06:21:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:09,551 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 334 transitions. [2022-07-14 06:21:09,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.2) internal successors, (110), 50 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:21:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 334 transitions. [2022-07-14 06:21:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 06:21:09,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:09,552 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:09,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-14 06:21:09,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:09,777 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-07-14 06:21:09,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:09,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1565727437, now seen corresponding path program 1 times [2022-07-14 06:21:09,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:09,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205037824] [2022-07-14 06:21:09,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:09,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:10,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:10,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205037824] [2022-07-14 06:21:10,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205037824] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:21:10,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046075160] [2022-07-14 06:21:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:10,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:10,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:10,079 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:21:10,080 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:21:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:10,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 06:21:10,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:10,303 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:21:10,344 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:10,344 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:21:10,374 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:21:10,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:10,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:21:10,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:10,402 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 21 treesize of output 20 [2022-07-14 06:21:10,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:21:10,455 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:21:10,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:10,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:10,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:10,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 48 [2022-07-14 06:21:10,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2022-07-14 06:21:10,533 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 34 treesize of output 22 [2022-07-14 06:21:10,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:10,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 19 [2022-07-14 06:21:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:10,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:10,690 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-14 06:21:10,690 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 16 treesize of output 15 [2022-07-14 06:21:10,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3671 (Array Int Int)) (v_ArrVal_3670 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3670))) (.cse2 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~first~0#1.base|) .cse2))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3671) |c_ULTIMATE.start_main_~first~0#1.base|) .cse2)) .cse1)))) is different from false [2022-07-14 06:21:10,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:10,755 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 128 treesize of output 129 [2022-07-14 06:21:10,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:10,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 251 [2022-07-14 06:21:10,769 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 117 treesize of output 113 [2022-07-14 06:21:24,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3664 Int) (v_arrayElimCell_255 Int) (v_ArrVal_3670 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse1 (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12)) (.cse6 (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and (not (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimCell_255)) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|) (= .cse0 .cse1)) (and (let ((.cse2 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_3664)))) (store .cse5 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~last~0#1.base|) .cse1 |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse4 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3670))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))) (= (select (select .cse2 .cse3) v_arrayElimCell_255) .cse3))) (not .cse6)) (and (forall ((v_arrayElimCell_256 Int)) (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_3664)))) (store .cse10 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse9 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3670))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (= .cse7 (select (select .cse8 .cse7) v_arrayElimCell_256))))) .cse6)))) is different from false [2022-07-14 06:21:26,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3664 Int) (v_arrayElimCell_255 Int) (v_ArrVal_3661 Int) (v_ArrVal_3670 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse1 (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12)) (.cse6 (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and (not (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimCell_255)) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|) (= .cse0 .cse1)) (and (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_3661) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_3664)))) (store .cse5 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~last~0#1.base|) .cse1 |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse4 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3670))))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))) (= .cse2 (select (select .cse3 .cse2) v_arrayElimCell_255)))) (not .cse6)) (and .cse6 (forall ((v_arrayElimCell_256 Int)) (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_3661) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_3664)))) (store .cse10 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse9 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3670))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (= .cse7 (select (select .cse8 .cse7) v_arrayElimCell_256))))))))) is different from false [2022-07-14 06:21:26,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:26,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:26,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:29,498 INFO L356 Elim1Store]: treesize reduction 1431, result has 34.6 percent of original size [2022-07-14 06:21:29,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 49 case distinctions, treesize of input 4776607702 treesize of output 4655186637